Abstract.
We study a new type of motion planning problem in dimension 2 and 3 via linear and quadratic quantifier elimination. The object to be moved and the free space are both semilinear sets with no convexity assumptions. The admissible motions are finite continuous sequences of translations along prescribed directions. When the number of translations is bounded in advance, then the corresponding path finding problem can be modelled and solved as a linear quantifier elimination problem. Moreover the problem to find a shortest or almost shortest admissible path can be modelled as a special quadratic quantifier elimination problem. We give upper complexity bounds on these problems, report experimental results using the elimination facilities of the REDLOG package of REDUCE, and indicate a possible application.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Author information
Authors and Affiliations
Additional information
Received: September 27, 1999; revised version: August 23, 2001
Rights and permissions
About this article
Cite this article
Weispfenning, V. Semilinear Motion Planning in REDLOG. AAECC 12, 455–475 (2001). https://doi.org/10.1007/s002000100086
Issue Date:
DOI: https://doi.org/10.1007/s002000100086