In this paper, we present a computational framework for automatic generation of provably correct control laws for planar robots in polygonal environments. Using polygon triangulation and discrete abstractions, we map continuous motion planning and control problems, specified in terms of triangles, to computationally inexpensive problems on finite-state-transition systems. In this framework, discrete planning algorithms in complex environments can be seamlessly linked to automatic generation of feedback control laws for robots with underactuation constraints and control bounds. We focus on fully actuated kinematic robots with velocity bounds and (underactuated) unicycles with forward and turning speed bounds.
|Original language||English (US)|
|Number of pages||11|
|Journal||IEEE Transactions on Robotics|
|State||Published - Oct 2005|
Bibliographical noteFunding Information:
Manuscript received September 23, 2004; revised February 16, 2005. This paper was recommended for publication by Associate Editor L. Parker and Editor S. Hutchinson upon evaluation of the reviewers’ comments. The work of C. Belta was supported in part by the National Science Foundation under NSF CAREER 0447721 and under NSF CNS 0410514. The work of G. Pappas was supported in part by the National Science Foundation under NSF CAREER 0132716 and under NSF ITR 0324977, and in part by the Army Research Office under MURI DAAD 19-02-01-0383.
- Discrete abstraction
- Hybrid system (HS)
- Motion planning