Symbolic computation for mobile robot path planning

1Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Motion planning for mobile robots is an arduous task. Among the various methods that have been proposed for the solution of this problem in its open loop version is the Lafferriere-Sussmann method, which is based on differential geometry and employs piecewise constant inputs. This paper gives a succinct description of the method and of a freely available software tool, called the Lie Algebraic Motion Planner - LAMP and written in Mathematica™, which automates motion planning based on this technique. © 2004 Elsevier Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Koussoulas, N. T. (2004). Symbolic computation for mobile robot path planning. Journal of Symbolic Computation, 37(6), 761–775. https://doi.org/10.1016/j.jsc.1999.05.001

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free