论文信息 - Two algorithms for a reachability problem in one-dimensional space

Two algorithms for a reachability problem in one-dimensional space

Two algorithms are proposed to solve a reachability problem among time-dependent obstacles in 1D space. In the first approach, the motion planning problem is reduced to a path existence problem in a directed graph. The algorithm is very simple, with running time O(n/sup 2/), where n is the complexity of obstacles in space-time. The second algorithm uses a sweep-line technique and has running time O(n log/sub 2/ n). Besides, the latter algorithm can be easily modified to compute a collision-free trajectory, if such trajectories exist.

Klaus Sutner | Dajin Wang

[1] Chee-Keng Yap,et al. A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.

[2] M. AdelsonVelskii,et al. AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION , 1963 .

[3] Micha Sharir,et al. Motion planning in the presence of moving obstacles , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[4] Micha Sharir,et al. An Efficient and Simple Motion Planning Algorithm for a Ladder Amidst Polygonal Barriers , 1987, J. Algorithms.

[5] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .

[6] Franco P. Preparata,et al. A New Approach to Planar Point Location , 1981, SIAM J. Comput..

[7] Bum Hee Lee,et al. Collision-Free Motion Planning of Two Robots , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[8] Dajin Wang. Finding the safest one-dimensional path among obstacles for the acceleration constrained robot , 1994 .

[9] Binay K. Bhattacharya,et al. Solving the Two-Dimensional Findpath Problem Using a Line-Triangle Representation of the Robot , 1988, J. Algorithms.

[10] Micha Sharir,et al. An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles , 1985, SCG '85.

[11] Micha Sharir,et al. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..