An Optimized Energy and Time Constraints-Based Path Planning for the Navigation of Mobile Robots Using an Intelligent Particle Swarm Optimization Technique

Mobile robots (MRs) typically require running for many hours on one charge of the battery. Electric autonomous mobile robots (AMRs) have become increasingly common in the manufacturing process in the last few years. MRs must often complete difficult assignments while gathering information across an...

Full description

Saved in:
Bibliographic Details
Published inApplied sciences Vol. 13; no. 17; p. 9667
Main Authors Raj, Ravi, Kos, Andrzej
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.09.2023
Subjects
Accuracy
Algorithms
data acquisition
energy
Energy consumption
Energy efficiency
Genetic algorithms
Information management
Literature reviews
Mathematical optimization
Methods
mobile robot (MR)
navigation
Optimization techniques
particle swarm optimization (PSO)
path planning
Planning
Robotics industry
Robots
Surveillance
Online AccessGet full text

Cover

More Information
Summary:Mobile robots (MRs) typically require running for many hours on one charge of the battery. Electric autonomous mobile robots (AMRs) have become increasingly common in the manufacturing process in the last few years. MRs must often complete difficult assignments while gathering information across an unknown area involving energy constraints and time-sensitive preferences. This paper estimates the information collection assignment for surveillance as a multi-objective optimization dilemma with both energy and time constraints. In this study, three main objectives during acquiring data are taken into consideration, including the greatest quantity of data acquired for surveillance, following a path where obstacles are least likely to be experienced, and traveling the smallest feasible path. To obtain the optimal path for an MR by addressing the presented issue, this approach presents an intelligent particle swarm optimization (PSO) technique that determines fitness value by simplifying the optimization task for achieving the shortest path for MR navigation. It allows particles to execute variable operations while maintaining most of the prior search information. The findings of the simulation show that this technique of the PSO algorithm can realize swift convergence and high accuracy when compared with different benchmark functions derived for PSO. A comparative discussion on various energy-efficient navigation techniques for MRs is also provided. Lastly, this study describes the possible future research directions.
ISSN:2076-3417
2076-3417
DOI:10.3390/app13179667