A computer-implemented method of planning a path for a mobile robot in the presence of a set of obstacles comprises: computing for each obstacle a probabilistic obstacle position distribution; computing at least one path-independent function as a combination of the probabilistic obstacle position ...
Path Relaxation is a method of planning safe paths around obstacles for mobile robots. It works in two steps: a global grid search that finds a rough path, followed by a local relaxation step that adjusts each node on the path to lower the overall path cost. The representation used by Pa...
A triangulation-based path planning algorithm for a mobile robot is presented. A circular robot operating in a planar polygonal environment cluttered with polygonal obstacles is considered. The free space of the robot consists of a polygonal region with polygonal holes. A method called bridge building...
The traditional ant colony algorithm is improved by introducing a new heuristic parameter the weight coefficient of which can be adjusted,so that quick con... C Sun,G Gui,D Han 被引量: 20发表: 2006年 Adaptive Ant Colony Algorithm-based Path Planning for Mobile Robot To solve the contradictor...
The paper presents an Artificial Force Functions(AFF)approach for mobile robot path planning to overcome some typical problems that may arise with the conventional Artificial Potential Functions(APF).This method introduces the relative position between the robot and the goal into repulsive function.The ...
path planningmulti colony ant algorithmThe task of planning trajectories for a mobile robot has received considerable attention in the research literature. The... NH Viet,NA Vien,SG Lee,... - International Conference on Advances in Computer-human Interaction 被引量: 87发表: 2008年 Research on ...
Path planning method for mobile robot based on ant colony optimization algorithm[A].Singapore 2008.Cen Y, Song C.Path planning method for mobile robot ... Y Cen,C Song,N Xie,... - IEEE 被引量: 41发表: 2008年 Global Path Planning for Mobile Robot Based on Improved Dijkstra Algorithm an...
Mobile robot and path planning method thereof for manipulating target objects A mobile robot and a path planning method are provided for the mobile robot to manipulate the target objects in a space, wherein the space consists of a periphery area and a central area. With the present method, an...
Good path planning technology of mobile robot can not only save a lot of time, but also reduce the wear and capital investment of mobile robot. Several methodologies have been proposed and reported in the literature for the path planning of mobile robot. Although these methodologies do not guara...
Sequential path planning for a formation of mobile robots with split and merge An algorithm for robot formation path planning is presented in this paper. Given a map of the working environment, the algorithm finds a path for a formati... ME Pereyra,RG Araguas,M Kulich - IEEE 被引量: 0...