Managing Mobile Robot Swarm with Particle Swarm Optimizer
A Particle Swarm Optimizer (PSO) and mobile robot swarm are two widely studied subjects. Many applications emerge separately while the similarity between them is rarely explored. When a solution space is a certain region in reality, a robot swarm can replace a particle one to explore the optimal solution by performing PSO. In this way, a mobile robot swarm should be able to efficiently explore an area just like a particle swarm and uninterruptedly work even under the shortage of robots or in the case of unexpected failure of robots. Furthermore, the moving distances of robots are highly constrained because energy of robots is limited and so is their operation time. Inspired by such requirements, this presentation discusses a Moving-distance-minimized PSO for a mobile robot swarm to minimize the total moving distance of its robots while performing optimization and collaboration. The distances between the current robot positions and the particle ones in the next generation are utilized to derive paths for robots such that the total distance that all robots move is minimized, hence minimizing the energy and time for a robot swarm to locate the optima. Experimental results on optimizing benchmark functions show the advantage of the proposed method over the standard PSO. By adopting it, the moving distance of robots can be reduced by more than 40% while offering the same optimization effects. The implication is enormous since all population-based optimization algorithms can be potentially benefited from such replacement of their individuals with mobile robots, thus leading to their moving-distance-minimized variants.
Date and Time
Location
Hosts
Registration
-
Add Event to Calendar
- Heping Avenue 1178
- Yujiatou Campus, Wuhan University of Technology
- Wuhan, Hebei
- China 430063
- Building: Eastern Teaching Building
- Room Number: 416
- Contact Event Host
- Co-sponsored by Wuhan University of Technology
Speakers
Mengchu Zhou of New Jersey Institute of Technology
Managing Mobile Robot Swarm with Particle Swarm Optimizer
A Particle Swarm Optimizer (PSO) and mobile robot swarm are two widely studied subjects. Many applications emerge separately while the similarity between them is rarely explored. When a solution space is a certain region in reality, a robot swarm can replace a particle one to explore the optimal solution by performing PSO. In this way, a mobile robot swarm should be able to efficiently explore an area just like a particle swarm and uninterruptedly work even under the shortage of robots or in the case of unexpected failure of robots. Furthermore, the moving distances of robots are highly constrained because energy of robots is limited and so is their operation time. Inspired by such requirements, this presentation discusses a Moving-distance-minimized PSO for a mobile robot swarm to minimize the total moving distance of its robots while performing optimization and collaboration. The distances between the current robot positions and the particle ones in the next generation are utilized to derive paths for robots such that the total distance that all robots move is minimized, hence minimizing the energy and time for a robot swarm to locate the optima. Experimental results on optimizing benchmark functions show the advantage of the proposed method over the standard PSO. By adopting it, the moving distance of robots can be reduced by more than 40% while offering the same optimization effects. The implication is enormous since all population-based optimization algorithms can be potentially benefited from such replacement of their individuals with mobile robots, thus leading to their moving-distance-minimized variants.
Biography:
MengChu Zhou received his B.S. degree in Control Engineering from Nanjing University of Science and Technology, Nanjing, China in 1983, M.S. degree in Automatic Control from Beijing Institute of Technology, Beijing, China in 1986, and Ph. D. degree in Computer and Systems Engineering from Rensselaer Polytechnic Institute, Troy, NY in 1990. He joined the Department of Electrical and Computer Engineering, New Jersey Institute of Technology in 1990, and is now a Distinguished Professor. His interests are in intelligent automation, robotics, Petri nets, Internet of Things, edge/cloud computing, AI, and big data analytics. He has over 1400 publications including 19 books, over 900 journal papers including over 700 IEEE Transactions papers, 32 patents and 32 book-chapters. He is a recipient of Excellence in Research Prize and Medal from NJIT, Humboldt Research Award for US Senior Scientists from Alexander von Humboldt Foundation, and Franklin V. Taylor Memorial Award and the Norbert Wiener Award from IEEE Systems, Man, and Cybernetics Society, and Edison Patent Award from the Research & Development Council of New Jersey. He has been among most highly cited scholars since 2012 and ranked top one in the field of engineering worldwide in 2012 by Web of Science. His present Google citation count is well over 88,200 with h-index being 149. He was ranked #88 in the world among the 2025 Top 1000 Scientists in Computer Science in the World by Research.com. He is Fellow of IEEE (2003), International Federation of Automatic Control (IFAC), American Association for the Advancement of Science (AAAS), Chinese Association of Automation (CAA) and National Academy of Inventors (NAI).
Address:United States