Mobile Robot Motion Planning Considering Path Ambiguity of Moving Obstacles
نویسندگان
چکیده
This paper describes a motion planning method for mobile robot which considers the path ambiguity of moving obstacles. Each moving obstacle has a set of paths and their probabilities. The robot selects the motion which minimizes the expected time to reach its destination, by recursively predicting future states of each obstacle and then selecting the best motion for them. To calculate the motion for terminal nodes of the search tree, we use a randomized motion planner, which is an improved version of a previous method. Simulation results show the effectiveness of the proposed method.
منابع مشابه
Modeling Motion Uncertainty of Moving Obstacles for Robot Motion Planning
This paper describes a method of modeling the motion uncertainty of moving obstacles and its application to mobile robot motion planning. The method explicitly considers three sources of motion uncertainty: path ambiguity, velocity uncertainty, and observation uncertainty. The model is represented by a probabilistic distribution over possible position on a path of a moving obstacle. Using this ...
متن کاملProbabilistic Uncertainty Modeling of Obstacle Motion for Robot Motion Planning
This paper describes a method of modeling the motion uncertainty of moving obstacles and its application to mobile robot motion planning. The method explicitly considers three sources of uncertainty: path ambiguity, velocity uncertainty, and observation uncertainty. The uncertainty model represents the position of an obstacle at a certain time point by a probabilistic distribution over possible...
متن کاملImproved Path Planning in Highly Dynamic Environments Based on Time Variant Potential Fields
Introduction Planning collision-free paths is one of the basic skills for a mobile robot performing a goal-oriented task. Especially in highly dynamic environments such as robot soccer there is a need for smooth navigation avoiding the cooperating and competing players. Today, robots in RoboCup [5] are moving at speeds of up to 3 m/s. Navigation thus requires real time path planning considering...
متن کاملمسیریابی حرکت روباتهای ماشینواره با روش پیشروی سریع
The Robot Motion Planning (RMP) problem deals with finding a collision-free start-to-goal path for a robot navigating among workspace obstacles. Such a problem is also encountered in path planning of intelligent vehicles and Automatic Guided Vehicles (AGVs). In terms of kinematic constraints, the RMP problem can be categorized into two groups of Holonomic and Nonholonomic problems. In the first...
متن کاملFormation Control and Path Planning of Two Robots for Tracking a Moving Target
This paper addresses the dynamic path planning for two mobile robots in unknownenvironment with obstacle avoidance and moving target tracking. These robots must form atriangle with moving target. The algorithm is composed of two parts. The first part of thealgorithm used for formation planning of the robots and a moving target. It generates thedesired position for the robots for the next step. ...
متن کامل