Time complexity of two disjoint simple paths

Abstract

Abstract. Finding two disjoint simple paths on two given sets of points is a geometric problem introduced by Je Erickson. This problem has various applications in computational geometry, e.g. robot motion planning, generating polygon, etc. We will present a reduction from planar Hamiltonian path to this problem, and prove that it is NPcomplete. To the best of our knowledge, no study has considered its complexity up until now. We also present a reduction from planar Hamiltonian path problem to the problem of \ nding a path on given points in the presence of arbitrary obstacles" and prove that it is also NP-complete. Also, we present a heuristic algorithm with time complexity of O(n 4 ) to solve this problem. The proposed algorithm rst calculates the convex hull for each of the entry points and then produces two simple paths on the two entry point sets.

Two sufficient conditions for the existence of path factors in graphs

“…Kaneko [6] generalized this theorem to general graphs. For other results on graph factors, see [7][8][9][10][11][12][13][14][15][16][17][18][19][20][21].…”

Navigation of multiple humanoid robots using hybrid adaptive swarm‐adaptive ant colony optimisation technique

“…Deepak et al– tried to add some modifications to stand‐alone artificial intelligent techniques for performance improvement and compared the results of hybridisation with stand‐alone methods. Razzazi et al proposed an idea regarding time complexity of two disjoint simple paths. Their study is primarily applicable to path planning of mobile robots.…”

Static and Dynamic Path Planning of Humanoids using an Advanced Regression Controller

“…Singh et al [17][18][19] discussed the use of computational intelligence for smooth and collisionfree path generation for wheeled mobile robots. Razzazi and Sepahvand [20] proposed an idea regarding time complexity of two disjoint simple paths. Their study is primarily applicable to path planning of mobile robots.…”