Hostname: page-component-cb9f654ff-hqlzj Total loading time: 0 Render date: 2025-08-18T11:52:35.561Z Has data issue: false hasContentIssue false
  • English
  • Français

Speeding Up On-Line Route Scheduling for an Autonomous Robot Through Pre-Built Paths

Published online by Cambridge University Press:  14 July 2020

Raul Alves Open the ORCID record for Raul Alves [Opens in a new window] ,
Josué Silva de Morais  and
Keiji Yamanaka
Raul Alves*
Affiliation:
Faculty of Electrical Engineering, Federal University of Uberlândia, Uberlândia, Brazil E-mails: josue@ufu.br, keiji@ufu.br
Josué Silva de Morais
Affiliation:
Faculty of Electrical Engineering, Federal University of Uberlândia, Uberlândia, Brazil E-mails: josue@ufu.br, keiji@ufu.br
Keiji Yamanaka
Affiliation:
Faculty of Electrical Engineering, Federal University of Uberlândia, Uberlândia, Brazil E-mails: josue@ufu.br, keiji@ufu.br
*
*Corresponding author. E-mail: raul@ufu.br
Get access Rights & Permissions [Opens in a new window]

Summary

Today, robots can be found helping humans with their daily tasks. Some tasks require the robot to visit a set of locations in the environment efficiently, like in the Traveling Salesman Problem. As indoor environments are maze-like areas, feasible paths connecting locations must be computed beforehand, so they can be combined during the scheduling, which can be impracticable for real-time applications. This work presents an on-line Route Scheduling supported by a Fast Path Planning Method able to adjust pre-built paths. Experiments were carried out with virtual and real robots to evaluate time and quality of tours.

Keywords

Route schedulingAutonomous robotsTSPPath planningEvolutionary algorithm

Information

Type
Research Article
Information
Robotica , Volume 41 , Issue 1 , January 2023 , pp. 3 - 15
Copyright
© The Author(s), 2020. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Zielinska, T., “History of Service Robots,” Robotics: Concepts, Methodologies, Tools, and Applications (IGI Global, 2014) pp. 1–14, doi: 10.4018/978-1-4666-4607-0.ch001.Google Scholar
Matai, R., Singh, S. and Mittal, M. L., “Traveling Salesman Problem: An Overview of Applications, Formulations, and Solution Approaches,” In: Traveling Salesman Problem: Theory and Applications. (Davendra, D., ed.) (InTech, 2010) pp. 1–26.Google Scholar
Hart, P. E., Nilsson, N. J. and Raphael, B., “A formal basis for the heuristic determination of minimum cost paths” IEEE Trans. Syst. Sci. Cybern. 4(2), 100–107 (1968).CrossRefGoogle Scholar
LaValle, S. M. and Kuffner, J. J., “Rapidly-Exploring Random Trees: Progress and Prospects,” In: Algorithmic and Computational Robotics (Donald, B. R., Lynch, K. M. and Rus, D., eds.) (AK Peters/CRC Press, 2001) pp. 303–307.Google Scholar
Macharet, D. G., and Campos, M. F. M., “A survey on routing problems and robotic systems”, Robotica. 36(12), 1781–1803 (2018).CrossRefGoogle Scholar
Bolourian, N. and Hammad, A., “Path Planning of LiDAR-Equipped UAV for Bridge Inspection Considering Potential Locations of Defects,” In: Advances in Informatics and Computing in Civil and Construction Engineering (Proceedings of the 35th CIB W78 2018 Conference: IT in Design, Construction, and Management) (I. Mutis and T. Hartmann, eds.) (Springer, Cham, 2019) pp. 545–552.CrossRefGoogle Scholar
S. MahmoudZadeh, D. W. M. Powers and Zadeh, R. B., “Mission Planning in Terms of Task-Time Management and Routing,” In: Autonomy and Unmanned Vehicles: Augmented Reactive Mission and Motion Planning Architecture (Cognitive Science and Technology) (Springer, Singapore, 2019) pp. 55–71.Google Scholar
Arzamendia, M., Gregor, D., Reina, D. G. and Toral, S. L., “A Path Planning Approach of an Autonomous Surface Vehicle for Water Quality Monitoring Using Evolutionary Computation,” In: Technology for Smart Futures (Dastbaz, M., Arabnia, H. and Akhgar, B., eds.) (Springer, Cham, 2018) pp. 55–73.CrossRefGoogle Scholar
Noormohammadi-Asl, A. and Taghirad, H. D., “Multi-goal motion planning using traveling salesman problem in belief space” Inf. Sci. 471(1), 164–184 (2019)CrossRefGoogle Scholar
Sathiya, V. and Chinnadurai, M., “Evolutionary algorithms-based multi-objective optimal mobile robot trajectory planning”, Robotica. 37(8), 1363–1382 (2019).CrossRefGoogle Scholar
Abu-Dakka, F. J., Valero, F. J., Suñer, J. L. and Mata, V., “A direct approach to solving trajectory planning problems using genetic algorithms with dynamics considerations in complex environments”, Robotica. 33(3), 669–683 (2015).CrossRefGoogle Scholar
Azimi, S., Zainal Abidin, M. S. and Mohamed, Z., “Solving an agricultural robot routing problem with binary particle swarm optimization and a genetic algorithm,” Int. J. Mech. Eng. Rob. Res. 7(5), 521–527 (2018), doi: 10.18178/ijmerr.7.5.521-527.Google Scholar
Tsilomitrou, O., Evangeliou, N. and Tzes, A., “Mobile Robot Tour Scheduling Acting as Data Mule in a Wireless Sensor Network,” Proceedings of the 5th International Conference on Control, Decision and Information Technologies (IEEE-CoDIT), Thessaloniki, Greece (2018) pp. 327–332.Google Scholar
Cheng, J., Miao, Z., Li, B. and Xu, W., “An Improved ACO Algorithm for Mobile Robot Path Planning,” Proceedings of the International Conference on Information and Automation (IEEE-ICIA), Ningbo, China (2016) pp. 963–968.Google Scholar
Ghadiry, W., Habibi, J., Aghdam, A. G. and Zhang, Y., “Time-Efficient Trajectory Optimization in Patrolling Problems with Non-Prespecified Depots and Robots,” Proceedings of the 24th Mediterranean Conference on Control and Automation (IEEE-MED), Athens, Greece (2016) pp. 1047–1052.Google Scholar
Le, C., Pham, H. X. and La, H. M., “A Multi-Robotic System for Environmental Cleaning,” CoRR available at: http://arxiv.org/abs/1811.00690 (2018).Google Scholar
Goldberg, D. E., Genetic Algorithms in Search, Optimization and Machine Learning, 1st edition, (Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1989).Google Scholar