WO2023128868A3 - System and method for generating a plurality of travel routes for area - Google Patents

System and method for generating a plurality of travel routes for area Download PDF

Info

Publication number
WO2023128868A3
WO2023128868A3 PCT/SG2022/050933 SG2022050933W WO2023128868A3 WO 2023128868 A3 WO2023128868 A3 WO 2023128868A3 SG 2022050933 W SG2022050933 W SG 2022050933W WO 2023128868 A3 WO2023128868 A3 WO 2023128868A3
Authority
WO
WIPO (PCT)
Prior art keywords
sub
graphs
graph
travel routes
generating
Prior art date
Application number
PCT/SG2022/050933
Other languages
French (fr)
Other versions
WO2023128868A2 (en
Inventor
Tenindra Nadeeshan ABEYWICKRAMA
Chen Liang
Minbo QIU
Chunda DING
Original Assignee
Grabtaxi Holdings Pte. Ltd.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Grabtaxi Holdings Pte. Ltd. filed Critical Grabtaxi Holdings Pte. Ltd.
Publication of WO2023128868A2 publication Critical patent/WO2023128868A2/en
Publication of WO2023128868A3 publication Critical patent/WO2023128868A3/en

Links

Classifications

    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/3446—Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • 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
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Remote Sensing (AREA)
  • Radar, Positioning & Navigation (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Tourism & Hospitality (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Theoretical Computer Science (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Automation & Control Theory (AREA)
  • Traffic Control Systems (AREA)
  • Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)

Abstract

According to various embodiments, a system for generating a plurality of travel routes for an area is provided. The system comprises a processor configured to split a road network graph into a plurality of sub-graphs based on a target travel length; adjust a border between the plurality of sub-graphs based on a sum of lengths of all edges and a number of odd degree vertex included in each of the plurality of sub-graphs; if at least one of the plurality of sub-graphs does not configure a respective connected route, expand the sub-graph by adding at least one first edge and/or at least one first vertex which are adjacent to the sub-graph into the sub-graph, so that the sub-graph configures the respective connected route; and if each of the plurality of sub-graphs configures the respective connected route, generate the plurality of travel routes each corresponding to the plurality of sub-graphs.
PCT/SG2022/050933 2021-12-27 2022-12-27 System and method for generating a plurality of travel routes for area WO2023128868A2 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202111613016.6A CN116358575A (en) 2021-12-27 2021-12-27 System and method for generating multiple travel routes for an area
CN202111613016.6 2021-12-27

Publications (2)

Publication Number Publication Date
WO2023128868A2 WO2023128868A2 (en) 2023-07-06
WO2023128868A3 true WO2023128868A3 (en) 2023-09-07

Family

ID=86924721

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/SG2022/050933 WO2023128868A2 (en) 2021-12-27 2022-12-27 System and method for generating a plurality of travel routes for area

Country Status (2)

Country Link
CN (1) CN116358575A (en)
WO (1) WO2023128868A2 (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130238242A1 (en) * 2010-11-26 2013-09-12 International Business Machines Corporation Route selection system, method and program
US20160178386A1 (en) * 2009-07-09 2016-06-23 Tomtom Navigation B.V. Navigation devices and methods carried out thereon
US9784589B1 (en) * 2016-11-16 2017-10-10 Aimotive Kft Electronic route navigation method in a road network on a map
CN110487293A (en) * 2019-08-29 2019-11-22 湖南大学 A kind of efficient and privacy paths planning method based on extensive road network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160178386A1 (en) * 2009-07-09 2016-06-23 Tomtom Navigation B.V. Navigation devices and methods carried out thereon
US20130238242A1 (en) * 2010-11-26 2013-09-12 International Business Machines Corporation Route selection system, method and program
US9784589B1 (en) * 2016-11-16 2017-10-10 Aimotive Kft Electronic route navigation method in a road network on a map
CN110487293A (en) * 2019-08-29 2019-11-22 湖南大学 A kind of efficient and privacy paths planning method based on extensive road network

Also Published As

Publication number Publication date
WO2023128868A2 (en) 2023-07-06
CN116358575A (en) 2023-06-30

Similar Documents

Publication Publication Date Title
Gao et al. Approximation algorithms for sweep coverage problem with multiple mobile sensors
Chen et al. An efficient algorithm for constructing Hamiltonian paths in meshes
Laporte et al. Path based algorithms for metro network design
SG11201907519YA (en) Marketing method and system for internet insurance products
Kazakov et al. On segmenting logistical zones for servicing continuously developed consumers
Jallu et al. Distributed construction of connected dominating set in unit disk graphs
Chi et al. Traffic flow-based roadside unit allocation strategy for VANET
Ahadi et al. Touring a sequence of disjoint polygons: Complexity and extension
Shiri et al. Online optimization of first-responder routes in disaster response logistics
WO2023128868A3 (en) System and method for generating a plurality of travel routes for area
Chellali et al. A note on the independent Roman domination in unicyclic graphs
CN1959429B (en) Distributed map matching method and system
Khabbazian et al. Bounding interference in wireless ad hoc networks with nodes in random position
Alnovani et al. Control synthesis for traffic simulation in the urban road network
Xu et al. Market-based coordination of coupled robot systems
Meulemans et al. Area-preserving subdivision schematization
WO2022119764A3 (en) Weighted alternating paths in graphs for quantum computing
Balu et al. On (n, m)-iterated function systems
Mrad et al. Optimal solution of the discrete cost multicommodity network design problem
Ek et al. Efficiency of star-like graphs and the Atlanta subway network
CN110505671B (en) Data transmission method of bus self-organizing network
Nishat et al. Bend complexity and Hamiltonian cycles in grid graphs
Nelson et al. Multi-tribrackets
Alzboon et al. On the number of weighted shortest paths in the square grid
Banik et al. One-round discrete Voronoi game in R2 in presence of existing facilities

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 22916923

Country of ref document: EP

Kind code of ref document: A2