METHOD AND SYSTEM FOR ADAPTIVELY IDENTIFYING AN OPTIMAL ROUTE
The present disclosure provides methods and systems for adaptively identifying an optimal route. In some examples, there is provided a method comprising: determining, by a processor, one or more pick up points based on historical data relating to a starting location, the starting location being one...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Patent |
Sprache: | eng ; fre |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | LI, Yaohui WANG, Xiaoning DING, Chunda |
description | The present disclosure provides methods and systems for adaptively identifying an optimal route. In some examples, there is provided a method comprising: determining, by a processor, one or more pick up points based on historical data relating to a starting location, the starting location being one that is indicated in a request for a ride from the starting location to a destination location; determining, by the processor, one or more routes between each of the determined one or more pick up points and the destination location indicated in the ride request; and adaptively identifying, by the processor, an optimal route from the one or more routes based on at least one of a cheapest route, fastest route, shortest route and shortest walking distance.
La présente invention concerne des procédés et des systèmes pour identifier de manière adaptative un itinéraire optimal. Dans certains exemples, l'invention concerne un procédé comprenant les étapes suivantes : détermination, par un processeur, d'un ou plusieurs points de ramassage sur la base de données historiques relatives à un emplacement de départ, l'emplacement de départ étant un emplacement qui est indiqué dans une demande pour un transport depuis l'emplacement de départ vers un emplacement de destination ; détermination, par le processeur, d'un ou plusieurs itinéraires entre chacun desdits points de ramassage déterminés et l'emplacement de destination indiqué dans la demande de transport ; et identification adaptative, par le processeur, d'un itinéraire optimal à partir desdits itinéraires en se basant sur au moins l'un parmi un itinéraire le moins cher, un itinéraire le plus rapide, un itinéraire le plus court et une distance de marche la plus courte. |
format | Patent |
fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_WO2023244167A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>WO2023244167A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_WO2023244167A13</originalsourceid><addsrcrecordid>eNrjZLD1dQ3x8HdRcPRzUQiODA5x9VVw8w9ScHRxDAjxDHP1iVTwdHH1C_F0i_T0cweqUvAHivs6-igE-YeGuPIwsKYl5hSn8kJpbgZlN9cQZw_d1IL8-NTigsTk1LzUkvhwfyMDI2MjExNDM3NHQ2PiVAEA27Aq0w</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>METHOD AND SYSTEM FOR ADAPTIVELY IDENTIFYING AN OPTIMAL ROUTE</title><source>esp@cenet</source><creator>LI, Yaohui ; WANG, Xiaoning ; DING, Chunda</creator><creatorcontrib>LI, Yaohui ; WANG, Xiaoning ; DING, Chunda</creatorcontrib><description>The present disclosure provides methods and systems for adaptively identifying an optimal route. In some examples, there is provided a method comprising: determining, by a processor, one or more pick up points based on historical data relating to a starting location, the starting location being one that is indicated in a request for a ride from the starting location to a destination location; determining, by the processor, one or more routes between each of the determined one or more pick up points and the destination location indicated in the ride request; and adaptively identifying, by the processor, an optimal route from the one or more routes based on at least one of a cheapest route, fastest route, shortest route and shortest walking distance.
La présente invention concerne des procédés et des systèmes pour identifier de manière adaptative un itinéraire optimal. Dans certains exemples, l'invention concerne un procédé comprenant les étapes suivantes : détermination, par un processeur, d'un ou plusieurs points de ramassage sur la base de données historiques relatives à un emplacement de départ, l'emplacement de départ étant un emplacement qui est indiqué dans une demande pour un transport depuis l'emplacement de départ vers un emplacement de destination ; détermination, par le processeur, d'un ou plusieurs itinéraires entre chacun desdits points de ramassage déterminés et l'emplacement de destination indiqué dans la demande de transport ; et identification adaptative, par le processeur, d'un itinéraire optimal à partir desdits itinéraires en se basant sur au moins l'un parmi un itinéraire le moins cher, un itinéraire le plus rapide, un itinéraire le plus court et une distance de marche la plus courte.</description><language>eng ; fre</language><subject>CALCULATING ; COMPUTING ; COUNTING ; DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES ; GYROSCOPIC INSTRUMENTS ; MEASURING ; MEASURING DISTANCES, LEVELS OR BEARINGS ; NAVIGATION ; PHOTOGRAMMETRY OR VIDEOGRAMMETRY ; PHYSICS ; SURVEYING ; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR ; TESTING</subject><creationdate>2023</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20231221&DB=EPODOC&CC=WO&NR=2023244167A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76289</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20231221&DB=EPODOC&CC=WO&NR=2023244167A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>LI, Yaohui</creatorcontrib><creatorcontrib>WANG, Xiaoning</creatorcontrib><creatorcontrib>DING, Chunda</creatorcontrib><title>METHOD AND SYSTEM FOR ADAPTIVELY IDENTIFYING AN OPTIMAL ROUTE</title><description>The present disclosure provides methods and systems for adaptively identifying an optimal route. In some examples, there is provided a method comprising: determining, by a processor, one or more pick up points based on historical data relating to a starting location, the starting location being one that is indicated in a request for a ride from the starting location to a destination location; determining, by the processor, one or more routes between each of the determined one or more pick up points and the destination location indicated in the ride request; and adaptively identifying, by the processor, an optimal route from the one or more routes based on at least one of a cheapest route, fastest route, shortest route and shortest walking distance.
La présente invention concerne des procédés et des systèmes pour identifier de manière adaptative un itinéraire optimal. Dans certains exemples, l'invention concerne un procédé comprenant les étapes suivantes : détermination, par un processeur, d'un ou plusieurs points de ramassage sur la base de données historiques relatives à un emplacement de départ, l'emplacement de départ étant un emplacement qui est indiqué dans une demande pour un transport depuis l'emplacement de départ vers un emplacement de destination ; détermination, par le processeur, d'un ou plusieurs itinéraires entre chacun desdits points de ramassage déterminés et l'emplacement de destination indiqué dans la demande de transport ; et identification adaptative, par le processeur, d'un itinéraire optimal à partir desdits itinéraires en se basant sur au moins l'un parmi un itinéraire le moins cher, un itinéraire le plus rapide, un itinéraire le plus court et une distance de marche la plus courte.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</subject><subject>GYROSCOPIC INSTRUMENTS</subject><subject>MEASURING</subject><subject>MEASURING DISTANCES, LEVELS OR BEARINGS</subject><subject>NAVIGATION</subject><subject>PHOTOGRAMMETRY OR VIDEOGRAMMETRY</subject><subject>PHYSICS</subject><subject>SURVEYING</subject><subject>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><subject>TESTING</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2023</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZLD1dQ3x8HdRcPRzUQiODA5x9VVw8w9ScHRxDAjxDHP1iVTwdHH1C_F0i_T0cweqUvAHivs6-igE-YeGuPIwsKYl5hSn8kJpbgZlN9cQZw_d1IL8-NTigsTk1LzUkvhwfyMDI2MjExNDM3NHQ2PiVAEA27Aq0w</recordid><startdate>20231221</startdate><enddate>20231221</enddate><creator>LI, Yaohui</creator><creator>WANG, Xiaoning</creator><creator>DING, Chunda</creator><scope>EVB</scope></search><sort><creationdate>20231221</creationdate><title>METHOD AND SYSTEM FOR ADAPTIVELY IDENTIFYING AN OPTIMAL ROUTE</title><author>LI, Yaohui ; WANG, Xiaoning ; DING, Chunda</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_WO2023244167A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng ; fre</language><creationdate>2023</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</topic><topic>GYROSCOPIC INSTRUMENTS</topic><topic>MEASURING</topic><topic>MEASURING DISTANCES, LEVELS OR BEARINGS</topic><topic>NAVIGATION</topic><topic>PHOTOGRAMMETRY OR VIDEOGRAMMETRY</topic><topic>PHYSICS</topic><topic>SURVEYING</topic><topic>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</topic><topic>TESTING</topic><toplevel>online_resources</toplevel><creatorcontrib>LI, Yaohui</creatorcontrib><creatorcontrib>WANG, Xiaoning</creatorcontrib><creatorcontrib>DING, Chunda</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>LI, Yaohui</au><au>WANG, Xiaoning</au><au>DING, Chunda</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>METHOD AND SYSTEM FOR ADAPTIVELY IDENTIFYING AN OPTIMAL ROUTE</title><date>2023-12-21</date><risdate>2023</risdate><abstract>The present disclosure provides methods and systems for adaptively identifying an optimal route. In some examples, there is provided a method comprising: determining, by a processor, one or more pick up points based on historical data relating to a starting location, the starting location being one that is indicated in a request for a ride from the starting location to a destination location; determining, by the processor, one or more routes between each of the determined one or more pick up points and the destination location indicated in the ride request; and adaptively identifying, by the processor, an optimal route from the one or more routes based on at least one of a cheapest route, fastest route, shortest route and shortest walking distance.
La présente invention concerne des procédés et des systèmes pour identifier de manière adaptative un itinéraire optimal. Dans certains exemples, l'invention concerne un procédé comprenant les étapes suivantes : détermination, par un processeur, d'un ou plusieurs points de ramassage sur la base de données historiques relatives à un emplacement de départ, l'emplacement de départ étant un emplacement qui est indiqué dans une demande pour un transport depuis l'emplacement de départ vers un emplacement de destination ; détermination, par le processeur, d'un ou plusieurs itinéraires entre chacun desdits points de ramassage déterminés et l'emplacement de destination indiqué dans la demande de transport ; et identification adaptative, par le processeur, d'un itinéraire optimal à partir desdits itinéraires en se basant sur au moins l'un parmi un itinéraire le moins cher, un itinéraire le plus rapide, un itinéraire le plus court et une distance de marche la plus courte.</abstract><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | eng ; fre |
recordid | cdi_epo_espacenet_WO2023244167A1 |
source | esp@cenet |
subjects | CALCULATING COMPUTING COUNTING DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES GYROSCOPIC INSTRUMENTS MEASURING MEASURING DISTANCES, LEVELS OR BEARINGS NAVIGATION PHOTOGRAMMETRY OR VIDEOGRAMMETRY PHYSICS SURVEYING SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR TESTING |
title | METHOD AND SYSTEM FOR ADAPTIVELY IDENTIFYING AN OPTIMAL ROUTE |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T03%3A30%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=LI,%20Yaohui&rft.date=2023-12-21&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EWO2023244167A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |