There are many path planning algorithms designed for mobile robots with software implementation. In the case of dynamic environments high-speed planning and recomputation of paths is necessary to avoid collision of robots with moving objects. A hardware-efficient algorithm is presented for finding a path of a mobile robot on image of an environment captured by an overhead camera. The algorithm ...

Collision-free path planning algorithm for a mobile robot for Eurobot competition is described in this paper. Extended A* algorithm implements new methods of represenatation of the robot in a map. The robot is represented by the real shape and dimensions, not only as one point. Sofisticated checking of the collision-free path is used. This approach was implemented and tested in the robot softwa...

The paper presents a new path planning and replanning algorithm based on two-dimensional occupancy grid map of the environment, which integrates the focused D* (FD*) algorithm and Witkowski’s algorithm. The FD* algorithm is used for fast replanning and Witkowski’s algorithm is used for generating all optimal paths in the grid map. Our algorithm finds the shortest path in the geometrical space b...

| This paper addresses trajectory planning in a dynamic workspace, i.e. motion planning for a robot subject to dynamic constraints and moving in a workspace with moving obstacles. First is introduced the novel concept of state-time space, i.e. the state space of the robot augmented of the time dimension. Like connguration space which is a tool to formulate path planning problems, state-time spa...

| This paper addresses trajectory planning in dynamic workspaces, i.e. trajectory planning for a robot subject to dynamic constraints and moving in a workspace with moving obstacles. First is introduced the novel concept of state-time space, i.e. the state space of the robot augmented of the time dimension. Like the concept of connguration space which is a tool to formulate path planning proble...

In future planetary exploration missions, rovers will be required to autonomously traverse challenging environments. Much of the previous work in robot motion planning cannot be successfully applied to the rough-terrain planning problem. A model-based planning method is presented in this paper that is computationally efficient and takes into account uncertainty in the robot model, terrain model...

Biped robots have specific dynamical constraints and stability problems which reduce significantly their motion range. In these conditions, motion planning used for mobile robots cannot be applied to biped robots. In this paper, the path planning problem is seen as finding a sequence of footholds in a 3D environment, keeping robot stability, motion continuity and working within the structural c...

An improved cellular automata (CA) model is proposed and evaluated on a path planning problem for an autonomous robot. The objective is to construct a collision-free path from the robot’s initial position to the goal by applying the improved CA model and environment pre-processed images captured during its navigation. CA rules are used to enlarge obstacles and to perform three distance diffusio...

This paper proposes a composite local path planning method for multi-robot formation navigation with path deviation prevention using a repulsive function, A-star algorithm, and unscented Kalman filter (UKF). The repulsive function in the potential field method is used to avoid collisions among robots and obstacles. The A-star algorithm helps the robots to find an optimal local path. In addition...

In this paper, we study the path planning for khepera II mobile robot in an unknown environment. The well known heuristic D* lite algorithm is implemented to make the mobile robot navigate through static obstacles and find the shortest path from an initial position to a target position by avoiding the obstacles. and to perform efficient re-planning during exploration. The proposed path finding ...