Abstract
There is huge diversity among navigation and path-planning problems in the real world because of the enormous number and great variety of assumptions about the environments, constraints, and tasks imposed on a robot. To deal with this diversity, we propose a new solution to the path-planning and navigation of a mobile robot. In our approach, we formulated the following two problems at each time-step as discrete optimization problems: (1) estimation of a robot's location, and (2) action decision. For the first problem, we minimize an objective function that includes a data term, a constraint term, and a prediction term. This approach is an approximation of Markov localization. For the second problem, we define and minimize another objective function that includes a goal term, a smoothness term, and a collision term. Simulation results show the effectiveness of our approach.
Similar content being viewed by others
References
Kortenkamp D, Bonasso RP, Murphy R (eds) (1998) Artificial intelligence and mobile robots. AAAI Press/MIT Press, Menlo Park
Hwang YK, Ahuja N (1992) Gross motion planning: a survey, ACM Comput Surv 24:219–291
Burgard W, Fox D, Thrun S (1997) Active mobile robot localization. Proceedings of 15th Joint Conference on Artificial Intelligence (IJCAI97), Nagoya, Japan, August 23–29, 1997, vol 2, Morgan Kaufmann Publishers, San Diego, p 1346–1352.
Geman S, Geman D (1984) Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images, IEEE Trans, Pattern Anal Mach Intell PAMI-6, p 721–741
Thrun S, Bucken A, Burgard W, et al. (1998) Map learning and high-speed navigation in RHINO. In: Kortenkamp D, Bonasso RP, Murphy R (eds) Artificial intelligence and mobile robots. AAAI Press/MIT Press, Menlo Park, p 21–52
Williams RJ (1992) Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach Learn 8:229–256
Author information
Authors and Affiliations
About this article
Cite this article
Igarashi, H., Ioi, K. Path-planning and navigation of a mobile robot as discrete optimization problems. Artif Life Robotics 5, 72–76 (2001). https://doi.org/10.1007/BF02481342
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02481342