Loading [MathJax]/extensions/MathMenu.js
IEEE Xplore Search Results

Showing 1-25 of 10,350 resultsfor

Filter Results

Show

Results

This paper addresses the complete visual coverage path planning problem in raster terrain and presents an effective solution with hierarchy based on multiple observers siting and an evolutionary path planning algorithm. The main idea of the method is to get a nearly optimal complete visual coverage path by connecting all of the observers in the visual coverage set. Firstly a new deterministic algo...Show More
Multi-agent path planning is one of the important research directions of multi-agent cooperative control, among which multi-agent covering path planning (mCPP) is a hot topic at present. Nowadays, many researchers have put forward relevant algorithms, but in some specific cases, problems such as low success rate of planning and low computational efficiency have appeared. In this paper, a hybrid al...Show More
Unmanned Aircraft Vehicles (UAVs) have gained immense popularity for area coverage having applications such as environmental monitoring, demining, search and rescue, among others. Most of the existing studies exploring area coverage have considered only a single region, however, few recent studies have considered coverage of multiple distributed regions. One of the limitations which UAV suffers wh...Show More
As a universal optimization problem in automatic control, complete coverage path planning is one of the useful functions for intelligent sweeping robot, which makes sweeping robot complete sweeping more quickly and efficiently. Though conventional unit decomposition method has got solution, excessive decomposition for complex concave polygon environment and ignoring turning degrade the optimizatio...Show More
Path-planning is an important primitive for autonomous mobile robots that lets robots find the optimal path between two points. Typical path-planning algorithms deal with finding an optimized path from start to end using a map of the environment and the robot to be aware of its location with respect to the map. Complete coverage path planning algorithm, on the other hand, is used in application wh...Show More
This paper presents an algorithm of complete coverage path planning (CCPP) for cleaning robots in dynamic environments based on the rolling window approach and the distance transform algorithm. Before the coverage task, the robot models the static environment with a global grid map as priori knowledge. In the process of coverage, a rolling window is created, corresponding to which a local grid map...Show More
UAV has been a popular piece of equipment both in military and civilian applications. Groups of UAVs can form an UAV network and accomplish complicated missions such as rescue, searching, patrolling and mapping. One of the most active areas of research in UAV networks is that of area coverage problem which is usually defined as a problem of how well the UAV networks are able to monitor the given s...Show More
In order to improve coverage traversal efficiency of ocean survey for AUV, an improved exact cellular decomposition method is proposed. It combines exact cellular decomposition method and Differential Evolution, which reduce the task execution time and alleviate the problem of energy shortage due to obtaining the optimal cells traversal order. The simulation results verify that the improved exact ...Show More
In marine resource exploration and development, unmanned surface vehicles (USVs) often need to plan a safe and collision-free exploration path. When the environment is unknown, offline planning methods cannot provide an optimal solution; thus, online path planning must be conducted while exploring the environmental map. In this paper, we investigated how reinforcement learning can address this iss...Show More
Path planning plays a pivotal role in the realm of robotic intelligence. Its primary function is to break down tasks into executable motion instructions for the robot and furnish the necessary guidance for its operations. Consequently, the effectiveness of path planning significantly influences the efficiency of intelligent operations. Path planning methods are confronted with multifaceted task re...Show More
Complete coverage path planning is a key problem for autonomous cleaning robots, which concerns not only the cleaning efficiency but also the adaptability to unstructured environments. But the diversity of environments and limited perception ability of the robot make the problem still unsolved. In this paper, a novel strategy of combined coverage path planning is proposed, which combines the rando...Show More
Development of a mining robot represents the key-technology for commercial mining of manganese nodules from 5,000m deep seafloor. In this paper, we are concerned with the discussion on method of sweeping coverage path planning for the mining robot. The mining robot sweeps a two dimensional area, i.e. sea-floor, by using its collecting device and vehicle. Its path should be planned for maximizing o...Show More
In this paper, a coverage path planning (CPP) scheme for an unmanned aerial vehicle (UAV) in coverage observation is proposed. The algorithms begin by decomposing the task region into several unit circles. The positions of the unit circles are optimized by the improved Particle-Glowworm Swarm Optimization algorithm based on the area size of the unit circle and task region. Then the connection sequ...Show More
The existence of omitted areas is unacceptable in coverage missions such as maritime search and military reconnaissance. Therefore, it is crucial to plan a path that can guarantee the full coverage of the mission area and conform to the kinematic characteristics of Unmanned Surface Vehicles (USVs). To achieve this objective, this paper proposes a two-stage coverage path planning algorithm aimed at...Show More
Coverage path planning (CPP) is a vital task in various fields, including agriculture, robotics, and unmanned aerial vehicles. It involves determining a path that covers all points of a given area while avoiding obstacles and minimizing overlapping. This paper presents a comprehensive approach to CPP that consists of two main phases: formation and coverage. Agents are divided into several groups, ...Show More
Real-time unmanned aerial vehicle coverage path planning is a challenging task. Although different patterns are outlined and optimized, the algorithm of patterns generation given the width of the sensor’s footprint and the map with obstacles is rarely studied. A Cellular Automaton (CA) based algorithm is proposed and implemented for the spiral pattern and tested in maps with obstacles on the corne...Show More
The unmanned aerial vehicle coverage path planning problem is considered to propose an algorithm that is more flexible and easier to implement by computer. The pattern-based algorithm needs geometric analysis of the task area which makes it inflexible and hard to implementation. A Cellular Automation (CA) based algorithm is proposed and was implemented for the spiral pattern and tested in maps wit...Show More
Coverage path planning (CPP) for complex fields in precision farming is often solved by splitting the problem: Finding a good field decomposition and optimizing the paths for each individual field. While various techniques have been proposed for both steps, they are performed sequentially, ignoring the knowledge gain from performing CPP for field decomposition. To overcome this limitation, an appr...Show More
Path planning is one of the key technologies for autonomous robot navigation and operation. Based on global and local planning, full-coverage path planning is an essential method for solving tasks such as cleaning, inspection, and harvesting in a given area. In this work, complete coverage path planning of a known area is studied. First, navigation and operation within simple graphics like rectang...Show More
In this paper, the shortest path planning problem with maximal visual coverage in the raster terrain is studied with the proposal of a multi-objective evolutionary planner. By using a problem-specific representation of candidate solutions and genetic operators, our planner can handle the objectives of the visual coverage and the path length and find the non-dominated solutions efficiently. Utilizi...Show More
For the complete coverage path planning of multi-AUVs (autonomous underwater vehicles), a method of cooperative complete coverage path planning for multi-AUVs based on GBNN algorithm is proposed in this paper, where all AUVs share the common working environment information, and each AUV treats other AUVs as moving obstacles. Firstly, a grid map is constructed by discretizing the underwater workspa...Show More
In this paper, a novel complete coverage path planning method based on the biologically inspired neural networks, rolling path planning and heuristic searching approach is presented for mobile robot motion planning with obstacles avoidance. The biologically inspired neural network is used to model the environment and calculate the environment information, while the rolling planning technique and t...Show More
Recently unmanned aerial vehicles (UAVs) have been widely adopted by military and civilian applications due to their strong autonomies and adaptabilities. Although UAVs can achieve effective cost reduction and flexibility enhancement in the development of systems with search or surveillance missions, they result in a complex path planning problem. Especially in region coverage systems, coverage pa...Show More
In the field of aerial photography, UAVs can be used as an ideal carrier of sensors. It is meaningful to plan its coverage path combined with the sensor model. Previous works mainly used decentralized coverage to realize UAV formation cooperative operation, but for the aerial photography scene of a single task, the decentralized coverage algorithm is not effective. In this paper, a centralized cov...Show More
Area coverage is essential for robots used in cleaning, painting, and exploration applications. Reconfigurable robots have been introduced to solve the area coverage limitation of fixed-shape robots. The existing global coverage algorithms of reconfigurable robots are limited to consideration of a limited set of predefined shapes for the reconfiguration and do not consider the exact geometrical sh...Show More