详情

原文传递 Motion Planning in the Presence of Moving Obstacles

题名：	Motion Planning in the Presence of Moving Obstacles
作者：	Sharir, Micha;Reif, John H.;
关键词：	COMPUTATIONS, MOTION, COLLISION AVOIDANCE, VELOCITY, SIMULATION, POSITION(LOCATION), ROBOTICS, AIRCRAFT, DYNAMICS, TWO DIMENSIONAL, ROBOTS, DEGREES OF FREEDOM, THREE DIMENSIONAL, PLANNING, CONFIGURATIONS, CONSTANTS, BARRIERS, TRAJECTORIES, AUTOMOTIVE VEHICLES, ASTEROIDS.
摘要：	This paper investigates the computational complexity of planning the motion of a body B in 2-D or 3-D space, so as to avoid collision with moving obstacles of known, easily computed, trajectories. Dynamic movement problems are of fundamental importance to robotics, but their computational complexity has not previously been investigated. We provide evidence that the 3-D dynamic movement problem is intractable even if B has only a constant number of degrees of freedom of movement. In particular, we prove the problem is PSPACE-hard if B is given a velocity modulus bound on its movements and is NP hard even if B has no velocity modulus bound, where in both cases B has 6 degrees of freedom. To prove these results we use a unique method of simulation of a Turing machine which uses time to encode configurations (whereas previous lower bound proofs in robotics used the system position to encode configurations and so required unbounded number of degrees of freedom). We also investigate a natural class of dynamic problems which we call asteroid avoidance problems: B, the object we wish to move, is a convex polyhedron which is free to move by translation with bounded velocity modulus and the polyhedral obstacles have known translational trajectories but cannot rotate. This problem has many applications to robot, automobile, and aircraft collision avoidance.
总页数：	29
报告类型：	科技报告