1
|
Romeh AE, Mirjalili S. Multi-Robot Exploration of Unknown Space Using Combined Meta-Heuristic Salp Swarm Algorithm and Deterministic Coordinated Multi-Robot Exploration. SENSORS (BASEL, SWITZERLAND) 2023; 23:s23042156. [PMID: 36850750 PMCID: PMC9967542 DOI: 10.3390/s23042156] [Citation(s) in RCA: 1] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Received: 12/19/2022] [Revised: 01/25/2023] [Accepted: 02/10/2023] [Indexed: 06/12/2023]
Abstract
Multi-robot exploration means constructing a finite map using a group of robots in an obstacle chaotic space. Uncertainties are reduced by distributing search tasks to robots and computing the best action in real time. Many previous methods are based on deterministic or meta-heuristic algorithms, but limited work has combined both techniques to consolidate both classes' benefits and alleviate their drawbacks. This paper proposes a new hybrid method based on deterministic coordinated multi-robot exploration (CME) and the meta-heuristic salp swarm algorithm (SSA) to perform the search of a space. The precedence of adjacent cells around a robot is determined by deterministic CME using cost and utility. Then, the optimization process of the search space, improving the overall solution, is achieved utilizing the SSA. Three performance measures are considered to evaluate the performance of the proposed method: run time, percentage of the explored area, and the number of times when a method failed to continue a complete run. Experimental results compared four different methods, CME-GWO, CME-GWOSSA, CME-SCA, and CME, over seven maps with extra complexity varying from simple to complex. The results demonstrate how the proposed CME-SSA can outperform the four other methods. Moreover, the simulation results demonstrate that the proposed CME-SSA effectively distributes the robots over the search space to run successfully and obtain the highest exploration rate in less time.
Collapse
Affiliation(s)
- Ali El Romeh
- Centre for Artificial Intelligence Research and Optimisation, Torrens University Australia, Brisbane 4006, Australia
| | - Seyedali Mirjalili
- Centre for Artificial Intelligence Research and Optimisation, Torrens University Australia, Brisbane 4006, Australia
- Yonsei Frontier Lab, Yonsei University, Seoul 03722, Republic of Korea
- University Research and Innovation Center, Obuda University, 1034 Budapest, Hungary
| |
Collapse
|
2
|
Shen Z, Song J, Mittal K, Gupta S. CT-CPP: Coverage Path Planning for 3D Terrain Reconstruction Using Dynamic Coverage Trees. IEEE Robot Autom Lett 2022. [DOI: 10.1109/lra.2021.3119870] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/08/2022]
|
3
|
|
4
|
Le AV, Parween R, Elara Mohan R, Nhan NHK, Enjikalayil Abdulkader R. Optimization Complete Area Coverage by Reconfigurable hTrihex Tiling Robot. SENSORS 2020; 20:s20113170. [PMID: 32503188 PMCID: PMC7308827 DOI: 10.3390/s20113170] [Citation(s) in RCA: 21] [Impact Index Per Article: 5.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 04/14/2020] [Revised: 05/21/2020] [Accepted: 05/22/2020] [Indexed: 11/16/2022]
Abstract
Completed area coverage planning (CACP) plays an essential role in various fields of robotics, such as area exploration, search, rescue, security, cleaning, and maintenance. Tiling robots with the ability to change their shape is a feasible solution to enhance the ability to cover predefined map areas with flexible sizes and to access the narrow space constraints. By dividing the map into sub-areas with the same size as the changeable robot shapes, the robot can plan the optimal movement to predetermined locations, transform its morphologies to cover the specific area, and ensure that the map is completely covered. The optimal navigation planning problem, including the least changing shape, shortest travel distance, and the lowest travel time while ensuring complete coverage of the map area, are solved in this paper. To this end, we propose the CACP framework for a tiling robot called hTrihex with three honeycomb shape modules. The robot can shift its shape into three different morphologies ensuring coverage of the map with a predetermined size. However, the ability to change shape also raises the complexity issues of the moving mechanisms. Therefore, the process of optimizing trajectories of the complete coverage is modeled according to the Traveling Salesman Problem (TSP) problem and solved by evolutionary approaches Genetic Algorithm (GA) and Ant Colony Optimization (ACO). Hence, the costweight to clear a pair of waypoints in the TSP is defined as the required energy shift the robot between the two locations. This energy corresponds to the three operating processes of the hTrihex robot: transformation, translation, and orientation correction. The CACP framework is verified both in the simulation environment and in the real environment. From the experimental results, proposed CACP capable of generating the Pareto-optimal outcome that navigates the robot from the goal to destination in various workspaces, and the algorithm could be adopted to other tiling robot platforms with multiple configurations.
Collapse
Affiliation(s)
- Anh Vu Le
- ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore; (A.V.L.); (R.P.); (R.E.M.); (R.E.A.)
- Optoelectronics Research Group, Faculty of Electrical and Electronics Engineering, Ton Duc Thang University, Ho Chi Minh City 700000, Vietnam
| | - Rizuwana Parween
- ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore; (A.V.L.); (R.P.); (R.E.M.); (R.E.A.)
| | - Rajesh Elara Mohan
- ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore; (A.V.L.); (R.P.); (R.E.M.); (R.E.A.)
| | - Nguyen Huu Khanh Nhan
- Optoelectronics Research Group, Faculty of Electrical and Electronics Engineering, Ton Duc Thang University, Ho Chi Minh City 700000, Vietnam
- Correspondence:
| | - Raihan Enjikalayil Abdulkader
- ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore; (A.V.L.); (R.P.); (R.E.M.); (R.E.A.)
| |
Collapse
|
5
|
Le AV, Nhan NHK, Mohan RE. Evolutionary Algorithm-Based Complete Coverage Path Planning for Tetriamond Tiling Robots. SENSORS 2020; 20:s20020445. [PMID: 31941127 PMCID: PMC7013451 DOI: 10.3390/s20020445] [Citation(s) in RCA: 36] [Impact Index Per Article: 9.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 11/27/2019] [Revised: 12/23/2019] [Accepted: 01/08/2020] [Indexed: 11/25/2022]
Abstract
Tiling robots with fixed morphology face major challenges in terms of covering the cleaning area and generating the optimal trajectory during navigation. Developing a self-reconfigurable autonomous robot is a probable solution to these issues, as it adapts various forms and accesses narrow spaces during navigation. The total navigation energy includes the energy expenditure during locomotion and the shape-shifting of the platform. Thus, during motion planning, the optimal navigation sequence of a self-reconfigurable robot must include the components of the navigation energy and the area coverage. This paper addresses the framework to generate an optimal navigation path for reconfigurable cleaning robots made of tetriamonds. During formulation, the cleaning environment is filled with various tiling patterns of the tetriamond-based robot, and each tiling pattern is addressed by a waypoint. The objective is to minimize the amount of shape-shifting needed to fill the workspace. The energy cost function is formulated based on the travel distance between waypoints, which considers the platform locomotion inside the workspace. The objective function is optimized based on evolutionary algorithms such as the genetic algorithm (GA) and ant colony optimization (ACO) of the traveling salesman problem (TSP) and estimates the shortest path that connects all waypoints. The proposed path planning technique can be extended to other polyamond-based reconfigurable robots.
Collapse
Affiliation(s)
- Anh Vu Le
- ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore; (A.V.L.); (R.E.M.)
- Optoelectronics Research Group, Faculty of Electrical and Electronics Engineering, Ton Duc Thang University, Ho Chi Minh City 700000, Vietnam
| | - Nguyen Huu Khanh Nhan
- Optoelectronics Research Group, Faculty of Electrical and Electronics Engineering, Ton Duc Thang University, Ho Chi Minh City 700000, Vietnam
- Correspondence:
| | - Rajesh Elara Mohan
- ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore; (A.V.L.); (R.E.M.)
| |
Collapse
|
6
|
Azpúrua H, Potje GA, Rezeck PAF, Freitas GM, Uzeda Garcia LG, Nascimento ER, Macharet DG, Campos MFM. Cooperative digital magnetic‐elevation maps by small autonomous aerial robots. J FIELD ROBOT 2019. [DOI: 10.1002/rob.21909] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
Affiliation(s)
- Héctor Azpúrua
- Robotics and ControlInstituto Tecnológico Vale ITVOuro Preto Minas Gerais Brazil
| | - Guilherme A. Potje
- Department of Computer ScienceUniversidade Federal de Minas GeraisBelo Horizonte Minas Gerais Brazil
| | - Paulo A. F. Rezeck
- Department of Computer ScienceUniversidade Federal de Minas GeraisBelo Horizonte Minas Gerais Brazil
| | - Gustavo M. Freitas
- Department of Electrical EngineeringUniversidade Federal de Minas GeraisBelo Horizonte Minas Gerais Brazil
| | | | - Erickson R. Nascimento
- Department of Computer ScienceUniversidade Federal de Minas GeraisBelo Horizonte Minas Gerais Brazil
| | - Douglas G. Macharet
- Department of Computer ScienceUniversidade Federal de Minas GeraisBelo Horizonte Minas Gerais Brazil
| | - Mario F. M. Campos
- Department of Computer ScienceUniversidade Federal de Minas GeraisBelo Horizonte Minas Gerais Brazil
| |
Collapse
|
7
|
Modeling and Analysis of hHoneycomb—A Polyhex Inspired Reconfigurable Tiling Robot. ENERGIES 2019. [DOI: 10.3390/en12132517] [Citation(s) in RCA: 11] [Impact Index Per Article: 2.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
Abstract
hHoneycomb, a self-reconfigurable cleaning robot, is designed based on tiling theory, to overcome the significant challenges experienced by the fixed morphology cleaning robot. It consists of four regular hexagonal units and the units are connected by a planar revolute joint which helps in reconfiguration. This platform attains six distinct configurations (bar, bee, arch, wave, worm, and pistol) and these configurations have circular arcs and irregular concave and convex boundary that would help in accessing various obstacles in the cleaning space. This work addresses the mechanical design, system-level modeling, reconfiguration of the platform via hinged joint mechanism, mobility of the platform, polyhex based tiling set, and power consumption during reconfiguration. The strength of the mechanical structure is studied based on the structural analysis of the system using finite element method. Based on the natural frequency and deformation pattern, the proposed design is validated and proven to overcome structural failure and system resonance. The kinematics formulation of the platform during locomotion and dynamics of each block during reconfiguration are derived. The robotic system is modeled in Simscape multibody toolbox of Matlab and the mobility of the platform is studied using the numerical simulation. Based on the real-time current consumption of each joint during reconfiguration, the energy efficient configuration and tiling set are addressed.
Collapse
|
8
|
Realization Energy Optimization of Complete Path Planning in Differential Drive Based Self-Reconfigurable Floor Cleaning Robot. ENERGIES 2019. [DOI: 10.3390/en12061136] [Citation(s) in RCA: 24] [Impact Index Per Article: 4.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
Abstract
The efficiency of energy usage applied to robots that implement autonomous duties such as floor cleaning depends crucially on the adopted path planning strategies. Energy-aware for complete coverage path planning (CCPP) in the reconfigurable robots raises interesting research, since the ability to change the robot’s shape needs the dynamic estimate energy model. In this paper, a CCPP for a predefined workspace by a new floor cleaning platform (hTetro) which can self-reconfigure among seven tetromino shape by the cooperation of hinge-based four blocks with independent differential drive modules is proposed. To this end, the energy consumption is represented by travel distances which consider operations of differential drive modules of the hTetro kinematic designs to fulfill the transformation, orientation correction and translation actions during robot navigation processes from source waypoint to destination waypoint. The optimal trajectory connecting all pairs of waypoints on the workspace is modeled and solved by evolutionary algorithms of TSP such as Genetic Algorithm (GA) and Ant Optimization Colony (AC) which are among the well-known optimization approaches of TSP. The evaluations across several conventional complete coverage algorithms to prove that TSP-based proposed method is a practical energy-aware navigation sequencing strategy that can be implemented to our hTetro robot in different real-time workspaces. Moreover, The CCPP framework with its modulation in this paper allows the convenient implementation on other polynomial-based reconfigurable robots.
Collapse
|
9
|
Modified A-Star Algorithm for Efficient Coverage Path Planning in Tetris Inspired Self-Reconfigurable Robot with Integrated Laser Sensor. SENSORS 2018; 18:s18082585. [PMID: 30087274 PMCID: PMC6111563 DOI: 10.3390/s18082585] [Citation(s) in RCA: 88] [Impact Index Per Article: 14.7] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 05/16/2018] [Revised: 06/28/2018] [Accepted: 07/13/2018] [Indexed: 12/04/2022]
Abstract
Advancing an efficient coverage path planning in robots set up for application such as cleaning, painting and mining are becoming more crucial. Such drive in the coverage path planning field proposes numerous techniques over the past few decades. However, the proposed approaches were only applied and tested with a fixed morphological robot in which the coverage performance was significantly degraded in a complex environment. To this end, an A-star based zigzag global planner for a novel self-reconfigurable Tetris inspired cleaning robot (hTetro) presented in this paper. Unlike the traditional A-star algorithm, the presented approach can generate waypoints in order to cover the narrow spaces while assuming appropriate morphology of the hTtero robot with the objective of maximizing the coverage area. We validated the efficiency of the proposed planning approach in the Robot Operation System (ROS) Based simulated environment and tested with the hTetro robot in real-time under the controlled scenarios. Our experiments demonstrate the efficiency of the proposed coverage path planning approach resulting in superior area coverage performance in all considered experimental scenarios.
Collapse
|
10
|
Abstract
SUMMARYThe field of robotics has received significant attention in our society due to the extensive use of robotic manipulators; however, recent advances in the research on autonomous vehicles have demonstrated a broader range of applications, such as exploration, surveillance, and environmental monitoring. In this sense, the problem of efficiently building a model of the environment using cooperative mobile robots is critical. Finding routes that are either length or time-optimized is essential for real-world applications of small autonomous robots. This paper addresses the problem of multi-robot area coverage path planning for geophysical surveys. Such surveys have many applications in mineral exploration, geology, archeology, and oceanography, among other fields. We propose a methodology that segments the environment into hexagonal cells and allocates groups of robots to different clusters of non-obstructed cells to acquire data. Cells can be covered by lawnmower, square or centroid patterns with specific configurations to address the constraints of magneto-metric surveys. Several trials were executed in a simulated environment, and a statistical investigation of the results is provided. We also report the results of experiments that were performed with real Unmanned Aerial Vehicles in an outdoor setting.
Collapse
|
11
|
Song J, Gupta S. <inline-formula>
<tex-math notation="LaTeX">$\varepsilon ^{\star }$</tex-math>
</inline-formula>: An Online Coverage Path Planning Algorithm. IEEE T ROBOT 2018. [DOI: 10.1109/tro.2017.2780259] [Citation(s) in RCA: 41] [Impact Index Per Article: 6.8] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/06/2022]
|
12
|
Autonomous Aeromagnetic Surveys Using a Fluxgate Magnetometer. SENSORS 2016; 16:s16122169. [PMID: 27999307 PMCID: PMC5191148 DOI: 10.3390/s16122169] [Citation(s) in RCA: 22] [Impact Index Per Article: 2.8] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 09/30/2016] [Accepted: 12/05/2016] [Indexed: 11/26/2022]
Abstract
Recent advances in the research of autonomous vehicles have showed a vast range of applications, such as exploration, surveillance and environmental monitoring. Considering the mining industry, it is possible to use such vehicles in the prospection of minerals of commercial interest beneath the ground. However, tasks such as geophysical surveys are highly dependent on specific sensors, which mostly are not designed to be used in these new range of autonomous vehicles. In this work, we propose a novel magnetic survey pipeline that aims to increase versatility, speed and robustness by using autonomous rotary-wing Unmanned Aerial Vehicles (UAVs). We also discuss the development of a state-of-the-art three-axis fluxgate, where our goal in this work was to refine and adjust the sensor topology and coupled electronics specifically for this type of vehicle and application. The sensor was built with two ring-cores using a specially developed stress-annealed CoFeSiB amorphous ribbon, in order to get sufficient resolution to detect concentrations of small ferrous minerals. Finally, we report on the results of experiments performed with a real UAV in an outdoor environment, showing the efficacy of the methodology in detecting an artificial ferrous anomaly.
Collapse
|
13
|
Abstract
This article describes an experimental investigation into the map-building and exploration capabilities of a mobile robot. Two types of map are used: a set of line and point features, and a grid-based free-space map. Potential features are ex tracted from sonar range readings and classed as "confirmed" if detected repeatedly. The free-space map is derived from the set of confirmed features. A distance-transform algorithm is then used to plan paths on this map. The confirmed features are used by a Kalman filter to estimate the robot's position relative to known objects. This research places exceptional stress on the need for practical experimentation and quantitative, statistical evaluation of the results. For this to be possible, it is essential to have a clearly defined measure of map quality. A novel metric is defined that predicts the effectiveness of the robot if it were to use the map to execute a set of test tasks. Exploration strategies are tested experimentally in a range of environments and starting positions. The results are eval uated and compared statistically. The tested strategies range from those that are totally reactive, such as wall-following, to those that use the developing map to focus attention on the un examined parts of the environment. The most promising results are observed from hybrid exploration strategies that combine the robustness of reactive navigation and the directive power of map-based strategies.
Collapse
Affiliation(s)
- David Lee
- Department of Computer Science Department of Anatomy and Developmental Biology University College London Gower Street London WC1E 6BT England
| | - Michael Recce
- Department of Computer Science Department of Anatomy and Developmental Biology University College London Gower Street London WC1E 6BT England
| |
Collapse
|
14
|
Acar EU, Choset H, Zhang Y, Schervish M. Path Planning for Robotic Demining: Robust Sensor-Based Coverage of Unstructured Environments and Probabilistic Methods. Int J Rob Res 2016. [DOI: 10.1177/02783649030227002] [Citation(s) in RCA: 149] [Impact Index Per Article: 18.6] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/15/2022]
Abstract
Demining and unexploded ordnance (UXO) clearance are extremely tedious and dangerous tasks. The use of robots bypasses the hazards and potentially increases the efficiency of both tasks. A first crucial step towards robotic mine/UXO clearance is to locate all the targets. This requires a path planner that generates a path to pass a detector over all points of a mine/UXO field, i.e., a planner that is complete .The current state of the art in path planning for mine/UXO clearance is to move a robot randomly or use simple heuristics . These methods do not possess completeness guarantees which are vital for locating all of the mines/UXOs. Using such random approaches is akin to intentionally using imperfect detectors. In this paper, we first overview our prior complete coverage algorithm and compare it with randomized approaches. In addition to the provable guarantees, we demonstrate that complete coverage achieves coverage in shorter time than random coverage. We also show that the use of complete approaches enables the creation of a filter to reject bad sensor readings, which is necessary for successful deployment of robots. We propose a new approach to handle sensor uncertainty that uses geometrical and topological features rather than sensor uncertainty models. We have verified our results by performing experiments in unstructured indoor environments. Finally, for scenarios where some a priori information about a minefield is available, we expedite the demining process by introducing a probabilistic method so that a demining robot does not have to perform exhaustive coverage.
Collapse
Affiliation(s)
- Ercan U. Acar
- Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213 USA
| | - Howie Choset
- Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213 USA
| | - Yangang Zhang
- Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213 USA
| | - Mark Schervish
- Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213 USA
| |
Collapse
|
15
|
Acar EU, Choset H. Sensor-based Coverage of Unknown Environments: Incremental Construction of Morse Decompositions. Int J Rob Res 2016. [DOI: 10.1177/027836402320556368] [Citation(s) in RCA: 110] [Impact Index Per Article: 13.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/17/2022]
Abstract
The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner for robots in unknown spaces. We achieve coverage using Morse decompositions which are exact cellular decompositions whose cells are defined in terms of critical points of Morse functions. Generically, two critical points define a cell. We encode the topology of the Morse decomposition using a graph that has nodes corresponding to the critical points and edges representing the cells defined by pairs of critical points. The robot simultaneously covers the space while incrementally constructing this graph. To achieve this, the robot must sense all the critical points. Therefore, we first introduce a critical point sensing method that uses range sensors. Then we present a provably complete algorithm which guarantees that the robot will encounter all the critical points, thereby constructing the full graph, i.e., achieving complete coverage. We also validate our approach by performing experiments on a mobile robot equipped with a sonar ring.
Collapse
|
16
|
Xu A, Viriyasuthee C, Rekleitis I. Efficient complete coverage of a known arbitrary environment with applications to aerial operations. Auton Robots 2013. [DOI: 10.1007/s10514-013-9364-x] [Citation(s) in RCA: 65] [Impact Index Per Article: 5.9] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/30/2022]
|
17
|
Hameed IA, Bochtis D, Sørensen CA. An Optimized Field Coverage Planning Approach for Navigation of Agricultural Robots in Fields Involving Obstacle Areas. INT J ADV ROBOT SYST 2013. [DOI: 10.5772/56248] [Citation(s) in RCA: 45] [Impact Index Per Article: 4.1] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/08/2022] Open
Abstract
Abstract Technological advances combined with the demand of cost efficiency and environmental considerations has led farmers to review their practices towards the adoption of new managerial approaches, including enhanced automation. The application of field robots is one of the most promising advances among automation technologies. Since the primary goal of an agricultural vehicle is the complete coverage of the cropped area within a field, an essential prerequisite is the capability of the mobile unit to cover the whole field area autonomously. In this paper, the main objective is to develop an approach for coverage planning for agricultural operations involving the presence of obstacle areas within the field area. The developed approach involves a series of stages including the generation of field-work tracks in the field polygon, the clustering of the tracks into blocks taking into account the in-field obstacle areas, the headland paths generation for the field and each obstacle area, the implementation of a genetic algorithm to optimize the sequence that the field robot vehicle will follow to visit the blocks and an algorithmic generation of the task sequences derived from the farmer practices. This approach has proven that it is possible to capture the practices of farmers and embed these practices in an algorithmic description providing a complete field area coverage plan in a form prepared for execution by the navigation system of a field robot.
Collapse
Affiliation(s)
- Ibrahim A. Hameed
- Aalborg University, Faculty of Engineering and Science, Dept. of Electronic Systems, Aalborg, Denmark
| | - Dionysis Bochtis
- University of Aarhus, Faculty of Science and Technology, Dept. of Engineering, Tjele, Denmark
| | - Claus A. Sørensen
- University of Aarhus, Faculty of Science and Technology, Dept. of Engineering, Tjele, Denmark
| |
Collapse
|
18
|
Ota J, Arai T, Yoshimura Y, Miyata N, Yoshida E, Kurabayashi D, Sasaki J. Motion planning of multiple mobile robots by a combination of learned visibility graphs and virtual impedance. Adv Robot 2012. [DOI: 10.1163/156855396x00246] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/19/2022]
Affiliation(s)
- Jun Ota
- a Department of Precision Machinery Engineering, Graduate School of Engineering, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113, Japan
| | - Tamio Arai
- b Department of Precision Machinery Engineering, Graduate School of Engineering, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113, Japan
| | - Yuji Yoshimura
- c Department of Precision Machinery Engineering, Graduate School of Engineering, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113, Japan
| | - Natsuki Miyata
- d Department of Precision Machinery Engineering, Graduate School of Engineering, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113, Japan
| | - Echi Yoshida
- e Mechanical Engineering Laboratory, 1-2 Namiki, Tsukuba, Ibaraki 305, Japan
| | - Daisuke Kurabayashi
- f Department of Precision Machinery Engineering, Graduate School of Engineering, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113, Japan
| | - Jun Sasaki
- g Department of Precision Machinery Engineering, Graduate School of Engineering, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113, Japan
| |
Collapse
|
19
|
Sankaranarayanan A, Masuda I. Robot map-making in an unknown scene: a general theory and a new algorithm. Adv Robot 2012. [DOI: 10.1163/156855393x00276] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/19/2022]
Affiliation(s)
- A. Sankaranarayanan
- a SECOM Intelligent Systems Laboratory, 7th Tachihi Building, 1-1, Sakaemachi 6-Chome, Tachikawa-Shi, Tokyo 190, Japan
| | - Isao Masuda
- b SECOM Intelligent Systems Laboratory, 7th Tachihi Building, 1-1, Sakaemachi 6-Chome, Tachikawa-Shi, Tokyo 190, Japan
| |
Collapse
|
20
|
Baek S, Lee TK, Se-Young OH, Ju K. Integrated On-Line Localization, Mapping and Coverage Algorithm of Unknown Environments for Robotic Vacuum Cleaners Based on Minimal Sensing. Adv Robot 2012. [DOI: 10.1163/016918611x584622] [Citation(s) in RCA: 9] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/19/2022]
Affiliation(s)
- Sanghoon Baek
- a Department of Electrical Engineering, Pohang University of Science and Technology, Pohang, Gyungbuk 790-784, South Korea;,
| | - Tae-Kyeong Lee
- b Department of Electrical Engineering, Pohang University of Science and Technology, Pohang, Gyungbuk 790-784, South Korea
| | - OH Se-Young
- c Department of Electrical Engineering, Pohang University of Science and Technology, Pohang, Gyungbuk 790-784, South Korea
| | - Kwangro Ju
- d Department of Electrical Engineering, Pohang University of Science and Technology, Pohang, Gyungbuk 790-784, South Korea
| |
Collapse
|
21
|
Abstract
The problem of incremental terrain acquisition is addressed in this paper. Through a systematic planning of movements in an unknown terrain filled with polygonal obstacles, a sensor-based robot is shown to be able to incrementally build the entire terrain model; the model will be described in terms of visibility graph and visibility window. The terrain model is built area by area without any overlapping between explored areas. As a consequence, the terrain is obtained as a tessellation of disjoint star polygons. And the adjacency relations between star polygons are represented by a star polygon adjacency graph (SPAG graph). The incremental exploration process consists of two basic tasks: local exploration and exploration merging. Useful lemmas are derived for these two tasks and, then, the algorithms for the tasks are given. Examples are used to illustrate the algorithms. Two strategies for planning robot movements in the unknown terrain environment are suggested and compared. They are the depth-first search and the breadth-first search applied to the SPAG graph. Finally, the performance evaluation of the method and comparison with some existing methods are presented.
Collapse
|
22
|
Luo C, Yang SX. A Bioinspired Neural Network for Real-Time Concurrent Map Building and Complete Coverage Robot Navigation in Unknown Environments. ACTA ACUST UNITED AC 2008. [DOI: 10.1109/tnn.2008.2000394] [Citation(s) in RCA: 144] [Impact Index Per Article: 9.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/08/2022]
|
23
|
Jin Y, Liao Y, Minai AA, Polycarpou MM. Balancing search and target response in cooperative unmanned aerial vehicle (UAV) teams. IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS. PART B, CYBERNETICS : A PUBLICATION OF THE IEEE SYSTEMS, MAN, AND CYBERNETICS SOCIETY 2006; 36:571-87. [PMID: 16761811 DOI: 10.1109/tsmcb.2005.861881] [Citation(s) in RCA: 78] [Impact Index Per Article: 4.3] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/06/2022]
Abstract
This paper considers a heterogeneous team of cooperating unmanned aerial vehicles (UAVs) drawn from several distinct classes and engaged in a search and action mission over a spatially extended battlefield with targets of several types. During the mission, the UAVs seek to confirm and verifiably destroy suspected targets and discover, confirm, and verifiably destroy unknown targets. The locations of some (or all) targets are unknown a priori, requiring them to be located using cooperative search. In addition, the tasks to be performed at each target location by the team of cooperative UAVs need to be coordinated. The tasks must, therefore, be allocated to UAVs in real time as they arise, while ensuring that appropriate vehicles are assigned to each task. Each class of UAVs has its own sensing and attack capabilities, so the need for appropriate assignment is paramount. In this paper, an extensive dynamic model that captures the stochastic nature of the cooperative search and task assignment problems is developed, and algorithms for achieving a high level of performance are designed. The paper focuses on investigating the value of predictive task assignment as a function of the number of unknown targets and number of UAVs. In particular, it is shown that there is a tradeoff between search and task response in the context of prediction. Based on the results, a hybrid algorithm for switching the use of prediction is proposed, which balances the search and task response. The performance of the proposed algorithms is evaluated through Monte Carlo simulations.
Collapse
Affiliation(s)
- Yan Jin
- Department of Electrical and Computer Engineering and Computer Science, University of Cincinnati, Cincinnati, OH 45221-0030, USA
| | | | | | | |
Collapse
|
24
|
|
25
|
|
26
|
A fuzzy controller with supervised learning assisted reinforcement learning algorithm for obstacle avoidance. ACTA ACUST UNITED AC 2003; 33:17-27. [DOI: 10.1109/tsmcb.2003.808179] [Citation(s) in RCA: 97] [Impact Index Per Article: 4.6] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/06/2022]
|
27
|
Taylor C, Kriegman D. Vision-based motion planning and exploration algorithms for mobile robots. ACTA ACUST UNITED AC 1998. [DOI: 10.1109/70.678451] [Citation(s) in RCA: 56] [Impact Index Per Article: 2.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
|
28
|
Ekman A, Torne A, Stromberg D. Exploration of polygonal environments using range data. IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS. PART B, CYBERNETICS : A PUBLICATION OF THE IEEE SYSTEMS, MAN, AND CYBERNETICS SOCIETY 1997; 27:250-255. [PMID: 18255863 DOI: 10.1109/3477.558809] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/25/2023]
Abstract
Several robotic problems involve the systematic traversal of the environment, commonly referred to as exploration. We present a strategy for the exploration of unknown finite polygonal environments, using a point robot with 1) no positional uncertainty and 2) an ideal range sensor that measures range in N uniformly distributed directions. The range data vector, obtained from the range sensor, corresponds to a sampled version of a visibility polygon. Visibility polygon edges that do not correspond to environmental edges are called jump edges and the exploration strategy is based on the fact that jump edges indicate directions of possibly unexplored environmental regions. We describe conditions under which it is possible to identify jump edges in the range data. We also show how the exploration strategy can be used in a solution to the terrain acquisition problem and describe conditions under which a solution is guaranteed within a finite number of measurements.
Collapse
Affiliation(s)
- A Ekman
- Dept. of Comput. & Inf. Sci., Linkoping Univ
| | | | | |
Collapse
|
29
|
|
30
|
Rao N. Robot navigation in unknown generalized polygonal terrains using vision sensors. ACTA ACUST UNITED AC 1995. [DOI: 10.1109/21.384257] [Citation(s) in RCA: 27] [Impact Index Per Article: 0.9] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
|
31
|
|