A new path planning method for Mobile Robots (MR) has been developed and implemented. On the one hand, based on the shortest path from the start point to the goal point, this path planner can choose the best moving directions of the MR, which helps to reach the target point as soon as possible. On the other hand, with an intelligent obstacle avoidance, our method can find th...

In this paper the path planning of robots is formulated in the context of an optimization framework. It is shown that generating motion trajectories for mobile robots in real environment is cast into a non-convex problem. Global optimization techniques in the non-convex framework are thus exploited to obtain the desired trajectories. The approach presented in this paper can easily take the robo...

The capability of automated rendezvous and docking is a key enabling technology for many government and commercial space programs. Future space systems will employ a high level of autonomy to acquire, repair, refuel, and reconfigure satellites. Several programs have demonstrated a subset of the necessary autonomous docking technology; however, none has demonstrated online path planning in-space...

The issues of path and trajectory planning algorithms and optimization of industrial manipulator trajectory generation are still not completely solved due to their variability and increasing complexity with the growing number of robot degrees of freedom. Generation of an optimal trajectory can be solved in several ways, such as traditional numeric and more recent approaches, which include evolu...

Node position information is one of the important issues in many wireless sensor networks usages. In this paper, based on path-planning and prediction, an indoor mobile target localization algorithm (PPIMT) is proposed. We first establish the path-planning model to constrain the movement trajectory of the mobile target in indoor environment according to indoor architectural pattern. Then, one c...

We describe two algorithms for static path-planning, with the aim of deriving the trajectory that always maximises the distance of the path from the nearest obstacle. The bubble algorithm allocates individual pixels to generating points, growing the area owned by each point at a globally constant rate to ensure that boundaries are equidistant between neighbouring points. The geometric algorithm...

This report addresses trajectory planning in 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 space ...

A potential-based genetic algorithm is proposed for the motion planning of robot swarms. The proposed algorithm consists of a global path planner and a motion planner. The global path planning algorithm plans a trajectory, which the robot swarm should follow, within a Voronoi diagram of the free space. The motion planning algorithm is a genetic algorithm based on artificial potential models. Th...

We consider nonlinear stochastic systems that arise in path planning and control of mobile robots. As is typical of almost all nonlinear stochastic systems, the optimally solving problem is intractable. We provide a design approach which yields a tractable design that is quantifiably nearoptimal. We exhibit a “separation” principle under a small noise assumption consisting of the optimal open-l...

In this paper a general procedure devoted to trajectory optimization is presented. This procedure is used for optimizing the trajectory of a parallel manipulator named CaPaMan (Cassino Parallel Manipulator) by using a performance criterion that includes the mechanical energy and the total traveling time. The resulting scalar objective function is then minimized. The trajectory is represented by...