By Topic

Programming and control of robots by means of differential algebraic inequalities

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
R. J. Spiteri ; Dept. of Math. & Stat., McGill Univ., Montreal, Que., Canada ; D. K. Pai ; U. M. Ascher

The method of programmed constraints has recently been proposed as an executable specification language for robot programming. The mathematical structures behind such problems are viability problems for control systems described by ordinary differential equations (ODE) subject to user-defined inequality constraints. This paper describes a method for the numerical solution of such problems, improving and extending some of our previous results. The algorithm presented is composed of three parts: delay-free discretization, local control, and local planning. Delay-free discretizations are consistent discretizations of control systems described by ODEs with discontinuous inputs. The local control is based on the minimization of an artificial, logarithmic barrier potential function. Local planning is a computationally inexpensive way to increase the robustness of the solution procedure, making it a refinement to a strategy based on viability alone. Simulations of a mobile robot are used to demonstrate the proposed strategy. Some complementarity is shown between the programmed-constraints approach to robot programming and optimal control. Moreover, we demonstrate the relative efficiency of our algorithm compared to optimal control: Typically, our method is able to find a solution on the order of 100 times faster than an optimal-control solver

Published in:

IEEE Transactions on Robotics and Automation  (Volume:16 ,  Issue: 2 )