scholarly journals A Two-Stage Method for Target Searching in the Path Planning for Mobile Robots

Sensors ◽  
2020 ◽  
Vol 20 (23) ◽  
pp. 6919
Author(s):  
Tao Song ◽  
Xiang Huo ◽  
Xinkai Wu

The path planning for target searching in mobile robots is critical for many applications, such as warehouse inspection and caring and surveillance for elderly people in the family scene. To ensure visual complete coverage from the camera equipped in robots is one of the most challenging tasks. To tackle this issue, we propose a two-stage optimization model to efficiently obtain an approximate optimal solution. In this model, we first develop a method to determine the key locations for visual complete coverage of a two-dimensional grid map, which is constructed by drawing lessons from the method of corner detection in the image processing. Then, we design a planning problem for searching the shortest path that passes all key locations considering the frequency of target occurrence. The testing results show that the proposed algorithm can achieve the significantly shorter search path length and the shorter target search time than the current Rule-based Algorithm and Genetic Algorithm (GA) in various simulation cases. Furthermore, the results show that the improved optimization algorithm with the priori known frequency of occurrence of the target can further improve the searching with shorter searching time. We also set up a test in a real environment to verify the feasibility of our algorithm.

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Hao-xiang Chen ◽  
Ying Nan ◽  
Yi Yang

We present a two-stage method for solving the terrain following (TF)/terrain avoidance (TA) path-planning problem for unmanned combat air vehicles (UCAVs). The 1st stage of planning takes an optimization approach for generating a 2D path on a horizontal plane with no collision with the terrain. In the 2nd stage of planning, an optimal control approach is adopted to generate a 3D flyable path for the UCAV that is as close as possible to the terrain. An approximate dynamic programming (ADP) algorithm is used to solve the optimal control problem in the 2nd stage by training an action network to approximate the optimal solution and training a critical network to approximate the value function. Numerical simulations indicate that ADP can determine the optimal control variables for UCAVs; relative to the conventional optimization method, the optimal control approach with ADP shows a better performance under the same conditions.


Author(s):  
Hongying Shan ◽  
Chuang Wang ◽  
Cungang Zou ◽  
Mengyao Qin

This paper is a study of the dynamic path planning problem of the pull-type multiple Automated Guided Vehicle (multi-AGV) complex system. First, based on research status at home and abroad, the conflict types, common planning algorithms, and task scheduling methods of different AGV complex systems are compared and analyzed. After comparing the different algorithms, the Dijkstra algorithm was selected as the path planning algorithm. Secondly, a mathematical model is set up for the shortest path of the total driving path, and a general algorithm for multi-AGV collision-free path planning based on a time window is proposed. After a thorough study of the shortcomings of traditional single-car planning and conflict resolution algorithms, a time window improvement algorithm for the planning path and the solution of the path conflict covariance is established. Experiments on VC++ software showed that the improved algorithm reduces the time of path planning and improves the punctual delivery rate of tasks. Finally, the algorithm is applied to material distribution in the OSIS workshop of a C enterprise company. It can be determined that the method is feasible in the actual production and has a certain application value by the improvement of the data before and after the comparison.


10.5772/58543 ◽  
2014 ◽  
Vol 11 (7) ◽  
pp. 94 ◽  
Author(s):  
Imen Châari ◽  
Anis Koubâa ◽  
Sahar Trigui ◽  
Hachemi Bennaceur ◽  
Adel Ammar ◽  
...  

2021 ◽  
Vol 14 (1) ◽  
pp. 55
Author(s):  
Eduardo Guzmán Ortiz ◽  
Beatriz Andres ◽  
Francisco Fraile ◽  
Raul Poler ◽  
Ángel Ortiz Bas

Purpose: The purpose of this paper is to describe the implementation of a Fleet Management System (FMS) that plans and controls the execution of logistics tasks by a set of mobile robots in a real-world hospital environment. The FMS is developed upon an architecture that hosts a routing engine, a task scheduler, an Endorse Broker, a controller and a backend Application Programming Interface (API). The routing engine handles the geo-referenced data and the calculation of routes; the task scheduler implements algorithms to solve the task allocation problem and the trolley loading problem using Integer Linear Programming (ILP) model and a Genetic Algorithm (GA) depending on the problem size. The Endorse Broker provides a messaging system to exchange information with the robotic fleet, while the controller implements the control rules to ensure the execution of the work plan. Finally, the Backend API exposes some FMS to external systems.Design/methodology/approach: The first part of the paper, focuses on the dynamic path planning problem of a set of mobile robots in indoor spaces such as hospitals, laboratories and shopping centres. A review of algorithms developed in the literature, to address dynamic path planning, is carried out; and an analysis of the applications of such algorithms in mobile robots that operate in real in-door spaces is performed. The second part of the paper focuses on the description of the FMS, which consists of five integrated tools to support the multi-robot dynamic path planning and the fleet management.Findings: The literature review, carried out in the context of path planning problem of multiple mobile robots in in-door spaces, has posed great challenges due to the environment characteristics in which robots move. The developed FMS for mobile robots in healthcare environments has resulted on a tool that enables to: (i) interpret of geo-referenced data; (ii) calculate and recalculate dynamic path plans and task execution plans, through the implementation of advanced algorithms that take into account dynamic events; (iii) track the tasks execution; (iv) fleet traffic control; and (v)  to communicate with one another external systems.Practical implications: The proposed FMS has been developed under the scope of ENDORSE project that seeks to develop safe, efficient, and integrated indoor robotic fleets for logistic applications in healthcare and commercial spaces. Moreover, a computational analysis is performed using a virtual hospital floor-plant.Originality/value: This work proposes a novel FMS, which consists of integrated tools to support the mobile multi-robot dynamic path planning in a real-world hospital environment. These tools include: a routing engine that handles the geo-referenced data and the calculation of routes. A task scheduler that includes a mathematical model to solve the path planning problem, when a low number of robots is considered. In order to solve large size problems, a genetic algorithm is also implemented to compute the dynamic path planning with less computational effort. An Endorse broker to exchanges information between the robotic fleet and the FMS in a secure way. A backend API that provides interface to manage the master data of the FMS, to calculate an optimal assignment of a set of tasks to a group of robots to be executed on a specific date and time, and to add a new task to be executed in the current shift. Finally, a controller to ensures that the robots execute the tasks that have been assigned by the task scheduler.


2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Yong Ma ◽  
Hongwei Wang ◽  
Langxiong Gan ◽  
Min Guo ◽  
Liwen Huang ◽  
...  

This paper aims at resolving the path planning problem in a time-varying environment based on the idea of overall conflict resolution and the algorithm of time baseline coordination. The basic task of the introduced path planning algorithms is to fulfill the automatic generation of the shortest paths from the defined start poses to their end poses with consideration of generous constraints for multiple mobile robots. Building on this, by using the overall conflict resolution, within the polynomial based paths, we take into account all the constraints including smoothness, motion boundary, kinematics constraints, obstacle avoidance, and safety constraints among robots together. And time baseline coordination algorithm is proposed to process the above formulated problem. The foremost strong point is that much time can be saved with our approach. Numerical simulations verify the effectiveness of our approach.


2022 ◽  
Vol 355 ◽  
pp. 03002
Author(s):  
Hongchao Zhao ◽  
Jianzhong Zhao

Aiming at the problems of long search time and local optimal solution of ant colony algorithm (ACA) in the path planning of unmanned aerial vehicle (UAV), an improved ant colony algorithm (IACA) was proposed from the aspects of simplicity and effectiveness. The flight performance constraints of fixed wing UAVs were treated as conditions of judging whether the candidate expanded nodes are feasible, thus the feasible nodes’ number was reduced and the search efficiency was effectively raised. In order to overcome the problem of local optimal solution, the pheromone update rule is improved by combining local pheromone update and global pheromone update. The heuristic function was improved by integrating the distance heuristic factor with the safety heuristic factor, and it enhanced the UAV flight safety performance. The transfer probability was improved to increase the IACA search speed. Simulation results show that the proposed IACA possesses stronger global search ability and higher practicability than the former IACA.


Sign in / Sign up

Export Citation Format

Share Document