Filters








13,662 Hits in 6.1 sec

Research on the mobile robots intelligent path planning based on ant colony algorithm application in manufacturing logistics [article]

Yue Guo, Xuelian Shen, Zhanfeng Zhu
2014 arXiv   pre-print
The problem of mobile robot path planning is studied by using ant colony algorithm, and it also provides some solving methods.  ...  This paper analyzes the current development of robot and path planning algorithm and focuses on the advantages and disadvantages of the traditional intelligent path planning as well as the path planning  ...  ACKNOWLEDGMENT We would like to thank the referees very much for their valuable comments and suggestions, there also got some help from Miss Lu Yan and Ms. Xu Si.  ... 
arXiv:1401.0889v2 fatcat:zd4s2uqwnvaevl6n447mzzfka4

Based on Ant Colony Algorithm to Solve the Mobile Robots Intelligent Path Planning for Avoid Obstacles

GUO Yue, SHEN Xuelian, ZHU Zhanfeng
2014 International Journal of Artificial Intelligence & Applications  
This paper analyzes the current development of robot and path planning algorithm for path planning to avoid obstacles in practice.  ...  We tried to find a good way in mobile robot path planning by using ant colony algorithm, and it also provides some solving methods.  ...  ACKNOWLEDGMENT We would like to thank the referees very much for their valuable comments and suggestions, there also got some help from Miss Lu Yan and Ms. Xu Si.  ... 
doi:10.5121/ijaia.2014.5101 fatcat:k6xgaj6tojg45lwthzpo36zyli

APPLICATION OF AN IMPROVED ANT COLONY ALGORITHM IN ROBOT PATH PLANNING AND MECHANICAL ARM MANAGEMENT

2021 International Journal of Mechatronics and Applied Mechanics  
It shows that the improved ant colony algorithm can make the robot with mechanical arm explore the optimal and shortest path in a short time.  ...  Under random terrain conditions and U-shaped obstacle terrain conditions, the robot path planning result based on the improved ant colony algorithm is the shortest and the condition is the best; however  ...  In the problem of path planning, it is necessary to consider energy consumption, the shortest time, the shortest distance and other related factors, and then formulate the optimal standard and find the  ... 
doi:10.17683/ijomam/issue10/v1.25 fatcat:nbhsefaqija5lhzaonyflaac4y

Target attraction-based ant colony algorithm for mobile robots in rescue missions

Xiaoyong Zhang, Jun Peng, osheng Hu, Kuo Chi Lin, Jing Wang
2012 International journal of Modeling, identification and control  
This paper presents a target attraction based ant colony (TAAC) algorithm for the dynamic path planning of mobile robots operated in rescue missions.  ...  After earthquake, the road conditions are usually unknown and hazard, which pose a great challenge for mobile robots to plan paths and reach the goal position safely for rescue operations.  ...  In the city traffic application (Jiang, et al., 2011 ) , the dynamic algorithm for the shortest path routing problem was proposed to model the city traffic path planning problem since the road condition  ... 
doi:10.1504/ijmic.2012.048920 fatcat:jpnoqjiz2bbpdatnxly4xi5n2e

A heuristic approach to finding diverse short paths

Caleb Voss, Mark Moll, Lydia E. Kavraki
2015 2015 IEEE International Conference on Robotics and Automation (ICRA)  
The usefulness of a such a set is illustrated in robotic motion planning and routing applications wherein a precomputed roadmap of the environment is partially invalidated by some change, for example,  ...  We compare the speed and quality of our heuristic algorithm's results against an exact algorithm that computes the optimally shortest set of paths on the roadmap having a minimum diversity.  ...  Then, both p and p are valid paths from s to g in G. Furthermore, though p is not the shortest in G, it is the shortest subject to a constraint, namely that it not traverse any edge in E\E .  ... 
doi:10.1109/icra.2015.7139774 dblp:conf/icra/VossMK15 fatcat:23cjrgzm2zcwdkflcb2mli4ngu

A Survey of Path Planning Algorithms for Mobile Robots

Karthik Karur, Nitin Sharma, Chinmay Dharmatti, Joshua E. Siegel
2021 Vehicles  
Path planning algorithms are used by mobile robots, unmanned aerial vehicles, and autonomous cars in order to identify safe, efficient, collision-free, and least-cost travel paths from an origin to a destination  ...  Choosing an appropriate path planning algorithm helps to ensure safe and effective point-to-point navigation, and the optimal algorithm depends on the robot geometry as well as the computing constraints  ...  It is also memory heavy [20] as it has to compute all the possible outcomes in order to determine the shortest path, and it cannot handle negative edges.  ... 
doi:10.3390/vehicles3030027 fatcat:ausuu34zvrf3jn7pp2mx262wki

Real-time clothoid approximation by Rational Bezier curves

Nicolas Montes, Alvaro Herraez, Leopoldo Armesto, Josep Tornero
2008 2008 IEEE International Conference on Robotics and Automation  
In addition to this, the proposed technique is tested on a real mobile robot for trajectory generation and kinematic control.  ...  By rescaling, rotating and translating the previously computed RBC, an on-line Clothoidal path is obtained. In this process, coefficients, weights and control points are kept invariant.  ...  Fig. 9 . 9 Bounded-curvature shortest path out of the shortest path Fig. 10 . 10 Open n: number of samples in the RBC. T: sampling period. V: mobile robot velocity. K: scaling factor.  ... 
doi:10.1109/robot.2008.4543548 dblp:conf/icra/MontesHAT08 fatcat:umsbenaylfhdlg3khmaqm3aeta

Cycle Time Optimized Path Planning for Industrial Robot using Robomaster

Supriya Sahu et al., Supriya Sahu et al.,
2017 International Journal of Mechanical and Production Engineering Research and Development  
Planning for path is important because, it allows knowing about the path traversal of robot from starting point and reaching the end point with shortest possible time in 3D workspace.  ...  The approach of this work is based on the use of robomaster software, for solving the path planning problems for industrial robot arms, that are used in industries and for any dynamic environments.  ...  [4] presented a new ant colony based approach, which is helpful in solving path planning problem for autonomous robotic application. Willigenburg et al.  ... 
doi:10.24247/ijmperdoct201710 fatcat:d5srsw7mnrdyzgo5p2awlhvtja

Reference Path Generation and Obstacle Avoidance for Autonomous Vehicles Based on Waypoints, Dubins Curves and Virtual Force Field Method

Gokhan Bayar
2017 International Journal of Applied Mathematics Electronics and Computers  
Waypoints were specified and the shortest path between the start and end points of the desired path was generated. Successful results were obtained and presented in this paper.  ...  In the first scenario, the path generation was tested for the case where obstacles, start and finish points of the reference path, and initial and final robot vehicle orientations were defined.  ...  This goal can be considered as a bounded-curvature shortest path problem.  ... 
doi:10.18100/ijamec.2017527489 fatcat:qgajvwc66ze2repgiuzwssl3bi

A Review: On using ACO Based Hybrid Algorithms for Path Planning of Multi-Mobile Robotics

Ibrahim Ismael Hamad, Mohammad S. Hasan
2020 International Journal of Interactive Mobile Technologies  
<p class="0abstract"><strong>Abstract-</strong>The path planning for Multi Mobile Robotic (MMR) system is a recent combinatorial optimisation problem.  ...  The original Dorigo's ACO algorithm uses exploration and exploitation phases to find the shortest route in a combinatorial optimisation problem in general without touching mapping, localisation and perception  ...  The original ACO performs well in complex combinatorial optimisation problems but it has convergence speed and local optima problems.  ... 
doi:10.3991/ijim.v14i18.16371 fatcat:ufakgwcsezdexhnuclcx42seey

Competitive searching in a generalized street

Amitava Datta, Christian Icking
1994 Proceedings of the tenth annual symposium on Computational geometry - SCG '94  
We present an on-line strategy for a robot to find the target in an unknown rectilinear G-street; the length of its path is at most 9 times the length of the shortest path in the L 1 metric, and 9.06 times  ...  We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far.  ...  We would like to thank the anonynous referees for their valuable comments.  ... 
doi:10.1145/177424.177622 dblp:conf/compgeom/DattaI94 fatcat:xqspvtsb55agrckbmk47t6uqjy

Competitive searching in a generalized street

Amitava Datta, Christian Icking
1999 Computational geometry  
We present an on-line strategy for a robot to find the target in an unknown rectilinear G-street; the length of its path is at most 9 times the length of the shortest path in the L 1 metric, and 9.06 times  ...  We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far.  ...  We would like to thank the anonynous referees for their valuable comments.  ... 
doi:10.1016/s0925-7721(99)00015-2 fatcat:r7pol4ppbzbg5exo7ujkld6jfy

Research on Adaptive Ant Colony Algorithm in Robot Hole Making Path Planning

Yanmei Liu, Zhen Chen, Xin Wang, Lei Zhang, Yongqing Ji
2017 International Journal of Control and Automation  
In this paper, the CATIA software is used to build the aircraft component model, Adaptive ant colony algorithm is proposed and applied to the design of robot path planning to get the shortest path between  ...  So adaptive ant colony algorithm adjusts the dynamic of pheromone volatile factor to improve the non-purpose of the way of making holes, the low path quality, and realizes the optimal path planning of  ...  Acknowledgments Firstly, this work was financially supported by the National Natural Science Foundation of China (61203352) and Aeronautical Science Foundation of China(2015ZE54026).  ... 
doi:10.14257/ijca.2017.10.5.18 fatcat:26qvr3wyq5exzfel3e7pizc2qq

Path Planning of an autonomous Mobile Robot using Swarm Based Optimization Techniques

Ibraheem Kasim Ibraheem, Fatin Hassan Ajeil
2017 ˜Al-œKhawarizmi engineering journal  
(ACO) has been proposed in this work to find the shortest and safest path for a mobile robot in different static environments with different complexities.  ...  conditions by providing the shortest path for multiple testing environments.  ...  Experiment (3) In this experiment the size of search space is (30×30) grid cell, and obstacles are located in random manner for obtain the optimal path, its show that the shortest path is (45. 1127).  ... 
doi:10.22153/kej.2016.08.002 fatcat:orzahles4fdmzigtujrmkcyune

Time-Dependent Shortest Path Queries Among Growing Discs [article]

Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
2018 arXiv   pre-print
As part of preprocessing, we execute O(1 ϵ(V_rV_c)) shortest path computations for fixed departure times, where V_r is the maximum speed of the robot and V_c is the minimum growth rate of the discs.  ...  Since we treat the shortest path computations as black-box functions, for different settings of growing discs, we can plug-in different shortest path algorithms.  ...  Thus, in order to find a shortest path form s to d, we can find a shortest path inĜ and reverse its direction.  ... 
arXiv:1808.01984v1 fatcat:3uzeke3pqzafjdxacsejqzqfga
« Previous Showing results 1 — 15 out of 13,662 results