MLchartDataset catalogue

Patent · US11514544B2 · B2 · US

Parking monitoring and assistance for transports

(11) Publication number
US11514544B2
(21) Application number
16/441,142
(22) Filing date
2019-06-14
(30) Priority date
2019-06-14
(43) Publication date
2022-11-29
(45) Date of grant
2022-11-29
(51) IPC
G05D 1/02; G06Q 50/30; G08G 1/00; G08G 1/14
(52) CPC
  • G06Q Information and communication technology [ICT] specially adapted for administrative, commercial, financial, managerial or supervisory purposes; systems or methods specially adapted for administrative, commercial, financial, managerial or supervisory purposes, not otherwise provided for: 50/40, 2220/10, 2240/00, 50/30
  • G05D Systems for controlling or regulating non-electric variables: 1/0225, 1/0287
  • G08G Traffic control systems: 1/143, 1/144, 1/148, 1/20
  • H04W Wireless communication networks: 4/024, 4/029, 4/44
(73) Assignee
Toyota Motor North America Inc
(72) Inventors
Daniel Warren Reaser
(54) Title
Parking monitoring and assistance for transports
(57) Abstract

An example operation may include one or more of identifying various transports with an assigned destination location, determining the transports assigned to the destination location exceeds a number of available parking spaces at the destination location, identifying alternative parking spaces in an area adjacent to the destination location, and assigning at least one of the alternative parking spaces to at least one of the transports based on a priority of the at least one transport.

Full text
View on Google Patents

Claims (20)

  1. A method, comprising: identifying a plurality of transports with an assigned destination location; determining the plurality of transports assigned to the destination location exceeds a number of available parking spaces at the destination location; identifying alternative parking spaces in an area adjacent to the destination location; and assigning at least one of the alternative parking spaces to at least one of the plurality of transports based on a priority of the at least one transport; and directing the at least one of the plurality of transports to the assigned alternative parking space.
  2. The method of claim 1, wherein the identifying the plurality of transports are assigned to the destination location is performed when one or more of the plurality of transports are traveling towards the destination location and prior to a start time of an event at the destination location.
  3. The method of claim 1, comprising: determining the priority of the at least one transport based on a previously assigned subscription status.
  4. The method of claim 1, wherein a distance between the alternative parking space and the destination location is a function of the priority of the at least one transport.
  5. The method of claim 1, comprising: moving the at least one transport to the destination location; unloading one or more occupants from the at least one transport; and moving the at least one transport to the assigned alternative parking space.
  6. The method of claim 1, comprising: invoking a smart contract stored in a distributed ledger; and responsive to invoking the smart contract, determining the priority of the at least one transport.
  7. The method of claim 6, comprising: creating a blockchain transaction identifying the at least one transport, the date, and an amount of compensation for the assigned alternative parking space; and storing the blockchain transaction in the distributed ledger.
  8. A system, comprising: a plurality of transports; a server configured to identify the plurality of transports with an assigned destination location; determine the plurality of transports assigned to the destination location exceeds a number of available parking spaces at the destination location; identify alternative parking spaces in an area adjacent to the destination location; and assign at least one of the alternative parking spaces to at least one of the plurality of transports based on a priority of the at least one transport; and direct the at least one of the plurality of transports to the assigned alternative parking space.
  9. The system of claim 8, wherein the server identifies the plurality of transports are assigned to the destination location when one or more of the plurality of transports are identified as in route to the destination location and prior to a start time of an event at the destination location.
  10. The system of claim 8, wherein the server is further configured to determine the priority of the at least one transport based on a previously assigned subscription status.
  11. The system of claim 8, wherein a distance between the alternative parking space and the destination location is a function of the priority of the at least one transport.
  12. The system of claim 8, wherein the server is further configured to move the at least one transport to the destination location; unload one or more occupants from the at least one transport; and move the at least one transport to the assigned alternative parking space.
  13. The system of claim 8, wherein the server is further configured to invoke a smart contract stored in a distributed ledger; and responsive to the smart contract being invoked, determine the priority of the at least one transport.
  14. The system of claim 1, wherein the server is further configured to create a blockchain transaction that identifies the at least one transport, the date, and an amount of compensation for the assigned alternative parking space; and store the blockchain transaction in the distributed ledger.
  15. A non-transitory computer readable storage medium configured to store instructions that when executed cause a processor to perform: identifying a plurality of transports with an assigned destination location; determining the plurality of transports assigned to the destination location exceeds a number of available parking spaces at the destination location; identifying alternative parking spaces in an area adjacent to the destination location; and assigning at least one of the alternative parking spaces to at least one of the plurality of transports based on a priority of the at least one transport; and directing the at least one of the plurality of transports to the assigned alternative parking space.
  16. The non-transitory computer readable storage medium of claim 15, wherein the identifying the plurality of transports are assigned to the destination location is performed when one or more of the plurality of transports are traveling towards the destination location and prior to a start time of an event at the destination location.
  17. The non-transitory computer readable storage medium of claim 15, wherein the processor is further configured to perform: determining the priority of the at least one transport based on a previously assigned subscription status.
  18. The non-transitory computer readable storage medium of claim 15, wherein a distance between the alternative parking space and the destination location is a function of the priority of the at least one transport.
  19. The non-transitory computer readable storage medium of claim 15, wherein the processor is further configured to perform: moving the at least one transport to the destination location; unloading one or more occupants from the at least one transport; and moving the at least one transport to the assigned alternative parking space.
  20. The non-transitory computer readable storage medium of claim 15, wherein the processor is further configured to perform: invoking a smart contract stored in a distributed ledger; and responsive to invoking the smart contract, determining the priority of the at least one transport.

Description

This application generally relates to automated parking assistance, and more particularly, to parking monitoring and assistance for transports.

Vehicles or transports, such as cars, motorcycles, trucks, planes, trains, etc., generally provide transportation needs to occupants and/or goods in a variety of ways. Functions related to transports may be identified and utilized by various computing devices, such as a smartphone or a computer.

Parking transports has always required time to identify optimal parking spaces which are close to a particular venue of interest to the transport passengers. As congestion increases the ability to identify optimal parking spaces decreases.

Autonomous transports which are operated without drivers can make parking easier since the transport could drop the passengers off at one location and park in another location. However, the ability to coordinate such parking procedures requires various information regarding where the passengers are going, when they are finished, and what preferences and privileges are available to those utilizing the nearby parking spaces.

Citations (78)

  • US3141612A
  • US6317720B1
  • US20020019760A1
  • CN1558345A
  • WO2006109828A1
  • US7834778B2
  • DE102006016050A1
  • CN101472371A
  • JP2009187346A
  • JP2009211253A
  • US9135821B2
  • US20110063132A1
  • KR101182853B1
  • EP2330580A1
  • US20120056758A1
  • US20110133959A1
  • US8779940B2
  • US8484151B1
  • US10152889B2
  • US20120188100A1
  • KR20120086140A
  • US9581997B1
  • US10127563B2
  • CN104011506A
  • US20140350854A1
  • JP2013135550A
  • CN104169990A
  • JP2014041475A
  • US20150279213A1
  • US9959761B2
  • CN104871220A
  • KR101552500B1
  • US9377319B2
  • AU2014202297B2
  • KR101711026B1
  • EP2849017B1
  • CN104442807B
  • CN104442807A
  • KR20150038776A
  • EP2869282B1
  • US20150149265A1
  • KR20170041166A
  • US9449512B2
  • WO2015169204A1
  • DE102014209453A1
  • JP6330509B2
  • US20180151069A1
  • US20160155276A1
  • EP3250443B1
  • JP2016151940A
  • WO2016148560A1
  • US20180301031A1
  • US20150346727A1
  • KR20170025206A
  • US10156848B1
  • US20190087877A1
  • US10037030B2
  • US20170372100A1
  • US20180174454A1
  • US20180268617A1
  • US20180286237A1
  • US20180313660A1
  • CN107067813A
  • US20210180954A1
  • US10299216B1
  • CN108335524B
  • CN108335524A
  • US20190325522A1
  • US20200037125A1
  • CN108986528A
  • CN108986528B
  • CN109147382A
  • CN109147382B
  • US20200134592A1
  • CN209132970U
  • US20200193721A1
  • CN111337038A
  • US20200005642A1
Record as JSON
{
  "publication_number": "US11514544B2",
  "country": "US",
  "kind": "B2",
  "title": "Parking monitoring and assistance for transports",
  "abstract": "An example operation may include one or more of identifying various transports with an assigned destination location, determining the transports assigned to the destination location exceeds a number of available parking spaces at the destination location, identifying alternative parking spaces in an area adjacent to the destination location, and assigning at least one of the alternative parking spaces to at least one of the transports based on a priority of the at least one transport.",
  "claims": [
    "1. A method, comprising: identifying a plurality of transports with an assigned destination location; determining the plurality of transports assigned to the destination location exceeds a number of available parking spaces at the destination location; identifying alternative parking spaces in an area adjacent to the destination location; and assigning at least one of the alternative parking spaces to at least one of the plurality of transports based on a priority of the at least one transport; and directing the at least one of the plurality of transports to the assigned alternative parking space.",
    "2. The method of claim 1, wherein the identifying the plurality of transports are assigned to the destination location is performed when one or more of the plurality of transports are traveling towards the destination location and prior to a start time of an event at the destination location.",
    "3. The method of claim 1, comprising: determining the priority of the at least one transport based on a previously assigned subscription status.",
    "4. The method of claim 1, wherein a distance between the alternative parking space and the destination location is a function of the priority of the at least one transport.",
    "5. The method of claim 1, comprising: moving the at least one transport to the destination location; unloading one or more occupants from the at least one transport; and moving the at least one transport to the assigned alternative parking space.",
    "6. The method of claim 1, comprising: invoking a smart contract stored in a distributed ledger; and responsive to invoking the smart contract, determining the priority of the at least one transport.",
    "7. The method of claim 6, comprising: creating a blockchain transaction identifying the at least one transport, the date, and an amount of compensation for the assigned alternative parking space; and storing the blockchain transaction in the distributed ledger.",
    "8. A system, comprising: a plurality of transports; a server configured to identify the plurality of transports with an assigned destination location; determine the plurality of transports assigned to the destination location exceeds a number of available parking spaces at the destination location; identify alternative parking spaces in an area adjacent to the destination location; and assign at least one of the alternative parking spaces to at least one of the plurality of transports based on a priority of the at least one transport; and direct the at least one of the plurality of transports to the assigned alternative parking space.",
    "9. The system of claim 8, wherein the server identifies the plurality of transports are assigned to the destination location when one or more of the plurality of transports are identified as in route to the destination location and prior to a start time of an event at the destination location.",
    "10. The system of claim 8, wherein the server is further configured to determine the priority of the at least one transport based on a previously assigned subscription status.",
    "11. The system of claim 8, wherein a distance between the alternative parking space and the destination location is a function of the priority of the at least one transport.",
    "12. The system of claim 8, wherein the server is further configured to move the at least one transport to the destination location; unload one or more occupants from the at least one transport; and move the at least one transport to the assigned alternative parking space.",
    "13. The system of claim 8, wherein the server is further configured to invoke a smart contract stored in a distributed ledger; and responsive to the smart contract being invoked, determine the priority of the at least one transport.",
    "14. The system of claim 1, wherein the server is further configured to create a blockchain transaction that identifies the at least one transport, the date, and an amount of compensation for the assigned alternative parking space; and store the blockchain transaction in the distributed ledger.",
    "15. A non-transitory computer readable storage medium configured to store instructions that when executed cause a processor to perform: identifying a plurality of transports with an assigned destination location; determining the plurality of transports assigned to the destination location exceeds a number of available parking spaces at the destination location; identifying alternative parking spaces in an area adjacent to the destination location; and assigning at least one of the alternative parking spaces to at least one of the plurality of transports based on a priority of the at least one transport; and directing the at least one of the plurality of transports to the assigned alternative parking space.",
    "16. The non-transitory computer readable storage medium of claim 15, wherein the identifying the plurality of transports are assigned to the destination location is performed when one or more of the plurality of transports are traveling towards the destination location and prior to a start time of an event at the destination location.",
    "17. The non-transitory computer readable storage medium of claim 15, wherein the processor is further configured to perform: determining the priority of the at least one transport based on a previously assigned subscription status.",
    "18. The non-transitory computer readable storage medium of claim 15, wherein a distance between the alternative parking space and the destination location is a function of the priority of the at least one transport.",
    "19. The non-transitory computer readable storage medium of claim 15, wherein the processor is further configured to perform: moving the at least one transport to the destination location; unloading one or more occupants from the at least one transport; and moving the at least one transport to the assigned alternative parking space.",
    "20. The non-transitory computer readable storage medium of claim 15, wherein the processor is further configured to perform: invoking a smart contract stored in a distributed ledger; and responsive to invoking the smart contract, determining the priority of the at least one transport."
  ],
  "description_excerpt": "This application generally relates to automated parking assistance, and more particularly, to parking monitoring and assistance for transports.\n\nVehicles or transports, such as cars, motorcycles, trucks, planes, trains, etc., generally provide transportation needs to occupants and/or goods in a variety of ways. Functions related to transports may be identified and utilized by various computing devices, such as a smartphone or a computer.\n\nParking transports has always required time to identify optimal parking spaces which are close to a particular venue of interest to the transport passengers. As congestion increases the ability to identify optimal parking spaces decreases.\n\nAutonomous transports which are operated without drivers can make parking easier since the transport could drop the passengers off at one location and park in another location. However, the ability to coordinate such parking procedures requires various information regarding where the passengers are going, when they are finished, and what preferences and privileges are available to those utilizing the nearby parking spaces.",
  "cpc": [
    "G06Q 50/40",
    "G05D 1/0225",
    "G05D 1/0287",
    "G06Q 2220/10",
    "G06Q 2240/00",
    "G06Q 50/30",
    "G08G 1/143",
    "G08G 1/144",
    "G08G 1/148",
    "G08G 1/20",
    "H04W 4/024",
    "H04W 4/029",
    "H04W 4/44"
  ],
  "ipc": [
    "G05D 1/02",
    "G06Q 50/30",
    "G08G 1/00",
    "G08G 1/14"
  ],
  "assignees": [
    "Toyota Motor North America Inc"
  ],
  "inventors": [
    "Daniel Warren Reaser"
  ],
  "filing_date": "2019-06-14",
  "publication_date": "2022-11-29",
  "grant_date": "2022-11-29",
  "priority_date": "2019-06-14",
  "application_number": "US-201916441142-A",
  "family_id": "73745631",
  "cited_by_count": 2,
  "citations": [
    "US3141612A",
    "US6317720B1",
    "US20020019760A1",
    "CN1558345A",
    "WO2006109828A1",
    "US7834778B2",
    "DE102006016050A1",
    "CN101472371A",
    "JP2009187346A",
    "JP2009211253A",
    "US9135821B2",
    "US20110063132A1",
    "KR101182853B1",
    "EP2330580A1",
    "US20120056758A1",
    "US20110133959A1",
    "US8779940B2",
    "US8484151B1",
    "US10152889B2",
    "US20120188100A1",
    "KR20120086140A",
    "US9581997B1",
    "US10127563B2",
    "CN104011506A",
    "US20140350854A1",
    "JP2013135550A",
    "CN104169990A",
    "JP2014041475A",
    "US20150279213A1",
    "US9959761B2",
    "CN104871220A",
    "KR101552500B1",
    "US9377319B2",
    "AU2014202297B2",
    "KR101711026B1",
    "EP2849017B1",
    "CN104442807B",
    "CN104442807A",
    "KR20150038776A",
    "EP2869282B1",
    "US20150149265A1",
    "KR20170041166A",
    "US9449512B2",
    "WO2015169204A1",
    "DE102014209453A1",
    "JP6330509B2",
    "US20180151069A1",
    "US20160155276A1",
    "EP3250443B1",
    "JP2016151940A",
    "WO2016148560A1",
    "US20180301031A1",
    "US20150346727A1",
    "KR20170025206A",
    "US10156848B1",
    "US20190087877A1",
    "US10037030B2",
    "US20170372100A1",
    "US20180174454A1",
    "US20180268617A1",
    "US20180286237A1",
    "US20180313660A1",
    "CN107067813A",
    "US20210180954A1",
    "US10299216B1",
    "CN108335524B",
    "CN108335524A",
    "US20190325522A1",
    "US20200037125A1",
    "CN108986528A",
    "CN108986528B",
    "CN109147382A",
    "CN109147382B",
    "US20200134592A1",
    "CN209132970U",
    "US20200193721A1",
    "CN111337038A",
    "US20200005642A1"
  ]
}

Record 928 of 8,000 in Patents full text (MLC-0201). Request the full dataset.