POINT OF INTEREST SEARCH ALONG A ROUTE WITH RETURN

A routing module identifies POIs that can be reached from a route with a cost less than distance m. A routing engine performs a reverse exploration on nodes in the planned route to locate POIs from which the route can be reached with a cost of less than a second cost n. POIs identified as being reac...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: POPPEN, Richard F, TANG, Weidong
Format: Patent
Sprache:eng ; fre ; ger
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 POPPEN, Richard F
TANG, Weidong
description A routing module identifies POIs that can be reached from a route with a cost less than distance m. A routing engine performs a reverse exploration on nodes in the planned route to locate POIs from which the route can be reached with a cost of less than a second cost n. POIs identified as being reachable from the route with a cost of less than m, and from which the route is reachable with a cost less than n are then further filtered to identify a subset of the POIs for which the sum of the time or distance from the route to the POI and the time or distance from the POI back to the route is less than a threshold time or distance, t.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_EP2414778B1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EP2414778B1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_EP2414778B13</originalsourceid><addsrcrecordid>eNrjZDAK8Pf0C1Hwd1MAUq5BrsEhCsGujkHOHgqOPv5-7gqOCkH-oSGuCuGeIR4KQa4hoUF-PAysaYk5xam8UJqbQcHNNcTZQze1ID8-tbggMTk1L7Uk3jXAyMTQxNzcwsnQmAglACShJmU</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>POINT OF INTEREST SEARCH ALONG A ROUTE WITH RETURN</title><source>esp@cenet</source><creator>POPPEN, Richard F ; TANG, Weidong</creator><creatorcontrib>POPPEN, Richard F ; TANG, Weidong</creatorcontrib><description>A routing module identifies POIs that can be reached from a route with a cost less than distance m. A routing engine performs a reverse exploration on nodes in the planned route to locate POIs from which the route can be reached with a cost of less than a second cost n. POIs identified as being reachable from the route with a cost of less than m, and from which the route is reachable with a cost less than n are then further filtered to identify a subset of the POIs for which the sum of the time or distance from the route to the POI and the time or distance from the POI back to the route is less than a threshold time or distance, t.</description><language>eng ; fre ; ger</language><subject>GYROSCOPIC INSTRUMENTS ; MEASURING ; MEASURING DISTANCES, LEVELS OR BEARINGS ; NAVIGATION ; PHOTOGRAMMETRY OR VIDEOGRAMMETRY ; PHYSICS ; SURVEYING ; TESTING</subject><creationdate>2018</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&amp;date=20180606&amp;DB=EPODOC&amp;CC=EP&amp;NR=2414778B1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,777,882,25545,76296</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20180606&amp;DB=EPODOC&amp;CC=EP&amp;NR=2414778B1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>POPPEN, Richard F</creatorcontrib><creatorcontrib>TANG, Weidong</creatorcontrib><title>POINT OF INTEREST SEARCH ALONG A ROUTE WITH RETURN</title><description>A routing module identifies POIs that can be reached from a route with a cost less than distance m. A routing engine performs a reverse exploration on nodes in the planned route to locate POIs from which the route can be reached with a cost of less than a second cost n. POIs identified as being reachable from the route with a cost of less than m, and from which the route is reachable with a cost less than n are then further filtered to identify a subset of the POIs for which the sum of the time or distance from the route to the POI and the time or distance from the POI back to the route is less than a threshold time or distance, t.</description><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>TESTING</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2018</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZDAK8Pf0C1Hwd1MAUq5BrsEhCsGujkHOHgqOPv5-7gqOCkH-oSGuCuGeIR4KQa4hoUF-PAysaYk5xam8UJqbQcHNNcTZQze1ID8-tbggMTk1L7Uk3jXAyMTQxNzcwsnQmAglACShJmU</recordid><startdate>20180606</startdate><enddate>20180606</enddate><creator>POPPEN, Richard F</creator><creator>TANG, Weidong</creator><scope>EVB</scope></search><sort><creationdate>20180606</creationdate><title>POINT OF INTEREST SEARCH ALONG A ROUTE WITH RETURN</title><author>POPPEN, Richard F ; TANG, Weidong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_EP2414778B13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng ; fre ; ger</language><creationdate>2018</creationdate><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>TESTING</topic><toplevel>online_resources</toplevel><creatorcontrib>POPPEN, Richard F</creatorcontrib><creatorcontrib>TANG, Weidong</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>POPPEN, Richard F</au><au>TANG, Weidong</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>POINT OF INTEREST SEARCH ALONG A ROUTE WITH RETURN</title><date>2018-06-06</date><risdate>2018</risdate><abstract>A routing module identifies POIs that can be reached from a route with a cost less than distance m. A routing engine performs a reverse exploration on nodes in the planned route to locate POIs from which the route can be reached with a cost of less than a second cost n. POIs identified as being reachable from the route with a cost of less than m, and from which the route is reachable with a cost less than n are then further filtered to identify a subset of the POIs for which the sum of the time or distance from the route to the POI and the time or distance from the POI back to the route is less than a threshold time or distance, t.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng ; fre ; ger
recordid cdi_epo_espacenet_EP2414778B1
source esp@cenet
subjects GYROSCOPIC INSTRUMENTS
MEASURING
MEASURING DISTANCES, LEVELS OR BEARINGS
NAVIGATION
PHOTOGRAMMETRY OR VIDEOGRAMMETRY
PHYSICS
SURVEYING
TESTING
title POINT OF INTEREST SEARCH ALONG A ROUTE WITH RETURN
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T12%3A57%3A37IST&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=POPPEN,%20Richard%20F&rft.date=2018-06-06&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EEP2414778B1%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