Related Experiment Video
Updated: Jul 12, 2025

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
Published on: October 14, 2017
Hierarchical Area-Based and Path-Based Heuristic Approaches for Multirobot Coverage Path Planning with Performance
Junghwan Gong1, Seunghwan Lee1
1School of Electronic Engineering, Kumoh National Institute of Technology, Gumi 39177, Republic of Korea.
This study introduces a new multirobot coverage path planning (MCPP) framework for surveillance, using advanced algorithms like genetic algorithms (GAs) and ant colony optimization (ACO). Area-based MCPP excels in path planning efficiency, while path-based MCPP offers better coverage balance.
Area of Science:
- Robotics and Automation
- Artificial Intelligence
- Operations Research
Background:
- Multirobot Coverage Path Planning (MCPP) is crucial for surveillance but often limited by naive approaches, especially when considering robot sensing range (SR).
- Existing MCPP methods primarily focus on cleaning tasks, lacking comprehensive strategies for surveillance applications that incorporate SR.
Purpose of the Study:
- To systematically explore hierarchical designs for MCPP tailored to surveillance applications, incorporating the sensing range (SR) factor.
- To propose a general MCPP framework that comprehensively addresses both path-based and area-based structures, utilizing advanced algorithms for enhanced planning.
Main Methods:
- Developed six distinct MCPP methods: two area-based (hierarchical max-flow routing with GA or ACO for Traveling Salesman Problem (TSP) within areas) and four path-based (global-local structures using GA and ACO combinations).
- Incorporated advanced TSP solvers like Genetic Algorithms (GAs) and Ant Colony Optimization (ACO) instead of naive approaches.
- Introduced ACO- or GA-based local planning in path-based methods to improve path quality and prevent degradation in global planning outcomes.
Main Results:
- Area-based MCPP approaches demonstrated superior performance in execution time and total path length compared to path-based methods.
- Path-based MCPP methods exhibited an advantage with smaller idle times.
- The proposed area-based MCPP method excels in path planning efficiency, while the path-based MCPP method shows better coverage balance.
Conclusions:
- The choice between area-based and path-based MCPP structures depends on specific application requirements, balancing efficiency, path length, and coverage.
- Leveraging the strengths of both methodologies allows for efficient MCPP execution in surveillance tasks.
- Future work will focus on adapting these MCPP structures for diverse real-world conditions to identify the most suitable approach for specific applications.
Related Concept Videos
Relative Motion Analysis using Rotating Axes-Problem Solving
Here, in order to determine the magnitude of velocity and acceleration for point...
Collisions in Multiple Dimensions: Problem Solving
A small car of mass 1,200 kg traveling east at 60 km/h collides at an intersection with a truck of mass 3,000 kg traveling due north at 40 km/h. The two vehicles are locked together. What is the...
Heuristics
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
Three-Dimensional Force System:Problem Solving
To solve a three-dimensional force system, first resolve each force into its respective scalar components. Do this using...
Two-Dimensional Force System: Problem Solving
The first step to solving a two-dimensional force system problem is to draw a free-body diagram of the object under consideration. This diagram helps identify all the external forces acting on the object, including their...
Area Computation by the Alternative Coordinate Method

