1
|
Karwowski J, Szynkiewicz W, Niewiadomska-Szynkiewicz E. Bridging Requirements, Planning, and Evaluation: A Review of Social Robot Navigation. SENSORS (BASEL, SWITZERLAND) 2024; 24:2794. [PMID: 38732900 PMCID: PMC11086376 DOI: 10.3390/s24092794] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Received: 03/25/2024] [Revised: 04/21/2024] [Accepted: 04/24/2024] [Indexed: 05/13/2024]
Abstract
Navigation lies at the core of social robotics, enabling robots to navigate and interact seamlessly in human environments. The primary focus of human-aware robot navigation is minimizing discomfort among surrounding humans. Our review explores user studies, examining factors that cause human discomfort, to perform the grounding of social robot navigation requirements and to form a taxonomy of elementary necessities that should be implemented by comprehensive algorithms. This survey also discusses human-aware navigation from an algorithmic perspective, reviewing the perception and motion planning methods integral to social navigation. Additionally, the review investigates different types of studies and tools facilitating the evaluation of social robot navigation approaches, namely datasets, simulators, and benchmarks. Our survey also identifies the main challenges of human-aware navigation, highlighting the essential future work perspectives. This work stands out from other review papers, as it not only investigates the variety of methods for implementing human awareness in robot control systems but also classifies the approaches according to the grounded requirements regarded in their objectives.
Collapse
Affiliation(s)
| | | | - Ewa Niewiadomska-Szynkiewicz
- Institute of Control and Computation Engineering, Warsaw University of Technology, 00-665 Warsaw, Poland; (J.K.); (W.S.)
| |
Collapse
|
2
|
Tang X, Pei H, Zhang D. Path Planning for a Wheel-Foot Hybrid Parallel-Leg Walking Robot. SENSORS (BASEL, SWITZERLAND) 2024; 24:2178. [PMID: 38610391 PMCID: PMC11014292 DOI: 10.3390/s24072178] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Received: 02/05/2024] [Revised: 03/12/2024] [Accepted: 03/18/2024] [Indexed: 04/14/2024]
Abstract
Mobile robots require the ability to plan collision-free paths. This paper introduces a wheel-foot hybrid parallel-leg walking robot based on the 6-Universal-Prismatic-Universal-Revolute and 3-Prismatic (6UPUR + 3P) parallel mechanism model. To enhance path planning efficiency and obstacle avoidance capabilities, an improved artificial potential field (IAPF) method is proposed. The IAPF functions are designed to address the collision problems and issues with goals being unreachable due to a nearby problem, local minima, and dynamic obstacle avoidance in path planning. Using this IAPF method, we conduct path planning and simulation analysis for the wheel-foot hybrid parallel-legged walking robot described in this paper, and compare it with the classic artificial potential field (APF) method. The results demonstrate that the IAPF method outperforms the classic APF method in handling obstacle-rich environments, effectively addresses collision problems, and the IAPF method helps to obtain goals previously unreachable due to nearby obstacles, local minima, and dynamic planning issues.
Collapse
Affiliation(s)
- Xinxing Tang
- College of Mechatronic Engineering, Changchun University of Technology, No. 2055, Chaoyang District, Changchun 130012, China; (H.P.); (D.Z.)
| | | | | |
Collapse
|
3
|
Modified type-2 fuzzy controller for intercollision avoidance of single and multi-humanoid robots in complex terrains. INTEL SERV ROBOT 2022. [DOI: 10.1007/s11370-022-00448-0] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/25/2022]
|
4
|
Abstract
Heuristic calculation is an essential method to solve optimisation problems. However, its vast computing requirements limit its real-time and online applications, especially in embedded systems with limited computing resources, such as mobile robots. This paper presents a robot path planning algorithm called DA-APF based on deterministic annealing. It is derived from the artificial potential field and can effectively solve the local minimum problem of the model established by the potential field method. The calculation performance of DA-APF is considerably improved by introducing temperature parameters to enhance the potential field function and by using annealing and tempering methods. Moreover, an optimal or near-optimal robot path planning scheme is given. A comprehensive case study is performed using heuristic methods, such as genetic algorithm and simulated annealing. Simulation results show that DA-APF performs well in various static path planning environments.
Collapse
|
5
|
Affiliation(s)
- Akshay Sarvesh
- Dept of Electrical and Computer Engineering, Texas A&M University, College Station, USA
| | - Austin Carroll
- Bush Combat Development Center, Texas A&M University, College Station, USA
| | | |
Collapse
|
6
|
Comparison Study of the PSO and SBPSO on Universal Robot Trajectory Planning. APPLIED SCIENCES-BASEL 2022. [DOI: 10.3390/app12031518] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
Abstract
Industrial robots were modified over the years. The benefit of robots is making production systems more efficient. Most methods of controlling robots have some limitations, such as stopping the robots. The robot stops by various reasons, such as collisions. The goal of this study is to study the comparison of improving the Artificial Potential Field (APF) by the traditional Particle Swarm Optimization (PSO) algorithm and the Serendipity-Based PSO (SBPSO) algorithm to control the path of a universal robot UR5 with collision avoidance. Already, the metaheuristic algorithm kinds deal with a premature convergence. This paper presents a new approach, which depends on the concept of serendipity and premature convergence applied to the path of the universal manipulator UR5 and also compares it with traditional the PSO. The features of the SBPSO algorithm prototype are formalized in this paper using the concept of serendipity in two dimensions: intelligence and chance. The results showed that the SBPSO is more efficient and has better convergence behavior than the traditional PSO for controlling the trajectory planning of the UR5 manipulator with obstacle avoidance.
Collapse
|
7
|
Abstract
Summary
This paper proposes an intelligent cooperative collision avoidance approach combining the enhanced potential field (EPF) with a fuzzy inference system (FIS) to resolve local minima and goal non-reachable with obstacles nearby issues and provide a near-optimal collision-free trajectory. A genetic algorithm is utilized to optimize parameters of membership function and rule base of the FISs. This work uses a single scenario containing all issues and interactions among unmanned aerial vehicles (UAVs) for training. For validating the performance, two scenarios containing obstacles with different shapes and several UAVs in small airspace are considered. Multiple simulation results show that the proposed approach outperforms the conventional EPF approach statistically.
Collapse
|
8
|
Abstract
AbstractIn this paper, we developed a new navigation system, called ATCM, which detects obstacles in a sliding window with an adaptive threshold clustering algorithm, classifies the detected obstacles with a decision tree, heuristically predicts potential collision and finds optimal path with a simplified Morphin algorithm. This system has the merits of optimal free-collision path, small memory size and less computing complexity, compared with the state of the arts in robot navigation. The modular design of 6-steps navigation provides a holistic methodology to implement and verify the performance of a robot’s navigation system. The experiments on simulation and a physical robot for the eight scenarios demonstrate that the robot can effectively and efficiently avoid potential collisions with any static or dynamic obstacles in its surrounding environment. Compared with the particle swarm optimisation, the dynamic window approach and the traditional Morphin algorithm for the autonomous navigation of a mobile robot in a static environment, ATCM achieved the shortest path with higher efficiency.
Collapse
|
9
|
Analysis of Obstacle Avoidance Strategy for Dual-Arm Robot Based on Speed Field with Improved Artificial Potential Field Algorithm. ELECTRONICS 2021. [DOI: 10.3390/electronics10151850] [Citation(s) in RCA: 8] [Impact Index Per Article: 2.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
Abstract
In recent years, dual-arm robots have been favored in various industries due to their excellent coordinated operability. One of the focused areas of study on dual-arm robots is obstacle avoidance, namely path planning. Among the existing path planning methods, the artificial potential field (APF) algorithm is widely applied in obstacle avoidance for its simplicity, practicability, and good real-time performance over other planning methods. However, APF is firstly proposed to solve the obstacle avoidance problem of mobile robot in plane, and thus has some limitations such as being prone to fall into local minimum, not being applicable when dynamic obstacles are encountered. Therefore, an obstacle avoidance strategy for a dual-arm robot based on speed field with improved artificial potential field algorithm is proposed. In our method, the APF algorithm is used to establish the attraction and repulsion functions of the robotic manipulator, and then the concepts of attraction and repulsion speed are introduced. The attraction and repulsion functions are converted into the attraction and repulsion speed functions, which mapped to the joint space. By using the Jacobian matrix and its inverse to establish the differential velocity function of joint motion, as well as comparing it with the set collision distance threshold between two robotic manipulators of robot, the collision avoidance can be solved. Meanwhile, after introducing a new repulsion function and adding virtual constraint points to eliminate existing limitations, APF is also improved. The correctness and effectiveness of the proposed method in the self-collision avoidance problem of a dual-arm robot are validated in MATLAB and Adams simulation environment.
Collapse
|
10
|
Chen J, Tan C, Mo R, Zhang H, Cai G, Li H. Research on path planning of three-neighbor search A* algorithm combined with artificial potential field. INT J ADV ROBOT SYST 2021. [DOI: 10.1177/17298814211026449] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/16/2022] Open
Abstract
Among the shortcomings of the A* algorithm, for example, there are many search nodes in path planning, and the calculation time is long. This article proposes a three-neighbor search A* algorithm combined with artificial potential fields to optimize the path planning problem of mobile robots. The algorithm integrates and improves the partial artificial potential field and the A* algorithm to address irregular obstacles in the forward direction. The artificial potential field guides the mobile robot to move forward quickly. The A* algorithm of the three-neighbor search method performs accurate obstacle avoidance. The current pose vector of the mobile robot is constructed during obstacle avoidance, the search range is narrowed to less than three neighbors, and repeated searches are avoided. In the matrix laboratory environment, grid maps with different obstacle ratios are compared with the A* algorithm. The experimental results show that the proposed improved algorithm avoids concave obstacle traps and shortens the path length, thus reducing the search time and the number of search nodes. The average path length is shortened by 5.58%, the path search time is shortened by 77.05%, and the number of path nodes is reduced by 88.85%. The experimental results fully show that the improved A* algorithm is effective and feasible and can provide optimal results.
Collapse
Affiliation(s)
- Jiqing Chen
- School of Mechanical Engineering, Guangxi University, Nanning, China
- Manufacturing System and Advanced Manufacturing Technology Key Laboratory, Guangxi Univerisity, Nanning, China
| | - Chenzhi Tan
- School of Mechanical Engineering, Guangxi University, Nanning, China
| | - Rongxian Mo
- School of Mechanical Engineering, Guangxi University, Nanning, China
| | - Hongdu Zhang
- School of Mechanical Engineering, Guangxi University, Nanning, China
| | - Ganwei Cai
- School of Mechanical Engineering, Guangxi University, Nanning, China
- Manufacturing System and Advanced Manufacturing Technology Key Laboratory, Guangxi Univerisity, Nanning, China
| | - Hengyu Li
- School of Mechatronic Engineering and Automation, Shanghai University, Shanghai, China
| |
Collapse
|
11
|
Incorporation of Potential Fields and Motion Primitives for the Collision Avoidance of Unmanned Aircraft. APPLIED SCIENCES-BASEL 2021. [DOI: 10.3390/app11073103] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
Abstract
Collision avoidance (CA) using the artificial potential field (APF) usually faces several known issues such as local minima and dynamically infeasible problems, so unmanned aerial vehicles’ (UAVs) paths planned based on the APF are safe only in a certain environment. This research proposes a CA approach that combines the APF and motion primitives (MPs) to tackle the known problems associated with the APF. Since MPs solve for a locally optimal trajectory with respect to allocated time, the trajectory obtained by the MPs is verified as dynamically feasible. When a collision checker based on the k-d tree search algorithm detects collision risk on extracted sample points from the planned trajectory, generating re-planned path candidates to avoid obstacles is performed. After rejecting unsafe route candidates, one applies the APF to select the best route among the remaining safe-path candidates. To validate the proposed approach, we simulated two meaningful scenario cases—the presence of static obstacles situation with local minima and dynamic environments with multiple UAVs present. The simulation results show that the proposed approach provides smooth, efficient, and dynamically feasible pathing compared to the APF.
Collapse
|
12
|
Tang B, Hirota K, Wu X, Dai Y, Jia Z. Path Planning Based on Improved Hybrid A* Algorithm. JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS 2021. [DOI: 10.20965/jaciii.2021.p0064] [Citation(s) in RCA: 4] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
Abstract
Hybrid A* algorithm has been widely used in mobile robots to obtain paths that are collision-free and drivable. However, the outputs of hybrid A* algorithm always contain unnecessary steering actions and are close to the obstacles. In this paper, the artificial potential field (APF) concept is applied to optimize the paths generated by the hybrid A* algorithm. The generated path not only satisfies the non-holonomic constraints of the vehicle, but also is smooth and keeps a comfortable distance to the obstacle at the same time. Through the robot operating system (ROS) platform, the path planning experiments are carried out based on the hybrid A* algorithm and the improved hybrid A* algorithm, respectively. In the experiments, the results show that the improved hybrid A* algorithm greatly reduces the number of steering actions and the maximum curvature of the paths in many different common scenarios. The paths generated by the improved algorithm nearly do not have unnecessary steering or sharp turning before the obstacles, which are safer and smoother than the paths generated by the hybrid A* algorithm for the autonomous ground vehicle.
Collapse
|
13
|
Path Planning and Real-Time Collision Avoidance Based on the Essential Visibility Graph. APPLIED SCIENCES-BASEL 2020. [DOI: 10.3390/app10165613] [Citation(s) in RCA: 13] [Impact Index Per Article: 3.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
Abstract
This paper deals with a novel procedure to generate optimum flight paths for multiple unmanned aircraft in the presence of obstacles and/or no-fly zones. A real-time collision avoidance algorithm solving the optimization problem as a minimum cost piecewise linear path search within the so-called Essential Visibility Graph (EVG) is first developed. Then, a re-planning procedure updating the EVG over a selected prediction time interval is proposed, accounting for the presence of multiple flying vehicles or movable obstacles. The use of Dubins curves allows obtaining smooth paths, compliant with flight mechanics constraints. In view of possible future applications in hybrid scenarios where both manned and unmanned aircraft share the airspace, visual flight rules compliant with International Civil Aviation Organization (ICAO) Annex II Right of Way were implemented. An extensive campaign of numerical simulations was carried out to test the effectiveness of the proposed technique by setting different operational scenarios of increasing complexity. Results show that the algorithm is always able to identify trajectories compliant with ICAO rules for avoiding collisions and assuring a minimum safety distance as well. Furthermore, the low computational burden suggests that the proposed procedure can be considered a promising approach for real-time applications.
Collapse
|
14
|
Smart Obstacle Avoidance Using a Danger Index for a Dynamic Environment. APPLIED SCIENCES-BASEL 2019. [DOI: 10.3390/app9081589] [Citation(s) in RCA: 13] [Impact Index Per Article: 2.6] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
Abstract
The artificial potential field approach provides a simple and effective motion planner for robot navigation. However, the traditional artificial potential field approach in practice can have a local minimum problem, i.e., the attractive force from the target position is in the balance with the repulsive force from the obstacle, such that the robot cannot escape from this situation and reach the target. Moreover, the moving object detection and avoidance is still a challenging problem with the current artificial potential field method. In this paper, we present an improved version of the artificial potential field method, which uses a dynamic window approach to solve the local minimum problem and define a danger index in the speed field for moving object avoidance. The new danger index considers not only the relative distance between the robot and the obstacle, but also the relative velocity according to the motion of the moving objects. In this way, the robot can find an optimized path to avoid local minimum and moving obstacles, which is proved by our experimental results.
Collapse
|
15
|
Antich Tobaruela J, Ortiz Rodríguez A. Reactive navigation in extremely dense and highly intricate environments. PLoS One 2017; 12:e0189008. [PMID: 29287078 PMCID: PMC5747469 DOI: 10.1371/journal.pone.0189008] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/03/2017] [Accepted: 11/16/2017] [Indexed: 11/19/2022] Open
Abstract
Reactive navigation is a well-known paradigm for controlling an autonomous mobile robot, which suggests making all control decisions through some light processing of the current/recent sensor data. Among the many advantages of this paradigm are: 1) the possibility to apply it to robots with limited and low-priced hardware resources, and 2) the fact of being able to safely navigate a robot in completely unknown environments containing unpredictable moving obstacles. As a major disadvantage, nevertheless, the reactive paradigm may occasionally cause robots to get trapped in certain areas of the environment-typically, these conflicting areas have a large concave shape and/or are full of closely-spaced obstacles. In this last respect, an enormous effort has been devoted to overcome such a serious drawback during the last two decades. As a result of this effort, a substantial number of new approaches for reactive navigation have been put forward. Some of these approaches have clearly improved the way how a reactively-controlled robot can move among densely cluttered obstacles; some other approaches have essentially focused on increasing the variety of obstacle shapes and sizes that could be successfully circumnavigated; etc. In this paper, as a starting point, we choose the best existing reactive approach to move in densely cluttered environments, and we also choose the existing reactive approach with the greatest ability to circumvent large intricate-shaped obstacles. Then, we combine these two approaches in a way that makes the most of them. From the experimental point of view, we use both simulated and real scenarios of challenging complexity for testing purposes. In such scenarios, we demonstrate that the combined approach herein proposed clearly outperforms the two individual approaches on which it is built.
Collapse
Affiliation(s)
- Javier Antich Tobaruela
- Department of Mathematics and Computer Science, University of the Balearic Islands, Palma de Mallorca, Spain
- * E-mail:
| | - Alberto Ortiz Rodríguez
- Department of Mathematics and Computer Science, University of the Balearic Islands, Palma de Mallorca, Spain
| |
Collapse
|