Time-minimum routes in time-dependent networks

Route planning for mobile robots in time-dependent networks is investigated. The mobile robot is constrained to move in a prespecified network of roads. The environment contains a set of moving obstacles which are not necessarily constrained to move along arcs of the network and whose motions are assumed to be known. Due to dynamic objects in the environment, connectivity in the network changes over time, i.e., the network is time-dependent. Given such an environment, a method is presented to find a collision-free route in the network that takes the mobile robot from a given start node to a destination node in minimum time. Our method generates a time-minimum path for all time intervals during which the destination node is reachable. The problem is solved by a two-level graph search: (1) path search using a space-time spanning tree, and (2) path search in a time-dependent network. Algorithms for the two subproblems are presented and execution time of the algorithms is analyzed. >

[1]  Toms Lozano-Pfrez.  On Multiple Moving Objects DTlC IELECTE ( 0 , 2022 .

[2]  Ren C. Luo,et al.  Motion planning for mobile robots in a dynamic environment with moving obstacles , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[3]  Emo WELZL,et al.  Constructing the Visibility Graph for n-Line Segments in O(n²) Time , 1985, Inf. Process. Lett..

[4]  Jean-Claude Latombe,et al.  Motion planning in the presence of moving obstacles , 1992 .

[5]  S. Zucker,et al.  Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .

[6]  Jonathan Halpern,et al.  Shortest route with time dependent length of edges and limited delay possibilities in nodes , 1977, Math. Methods Oper. Res..

[7]  Maria L. Gini,et al.  Path tracking through uncharted moving obstacles , 1990, IEEE Trans. Syst. Man Cybern..

[8]  Norman C. Griswold,et al.  Control for mobile robots in the presence of moving objects , 1990, IEEE Trans. Robotics Autom..

[9]  Suguru Arimoto,et al.  A Recursive Method of Trajectory Planning for a Point-Like Mobile Robot in Transient Environment Utilizing Paint Procedure , 1990 .

[10]  William A. Gruver,et al.  A unified approach for robot motion planning with moving polyhedral obstacles , 1990, IEEE Trans. Syst. Man Cybern..

[11]  Ariel Orda,et al.  Minimum weight paths in time-dependent networks , 1991, Networks.

[12]  Hanan Samet,et al.  A hierarchical strategy for path planning among moving obstacles [mobile robot] , 1989, IEEE Trans. Robotics Autom..

[13]  Christian Laugier,et al.  Path-velocity decomposition revisited and applied to dynamic trajectory planning , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.