Abstract-This paper addresses the problem of navigating a mobile robot with a limited field-of-view in a unknown dynamic environment. In such a situation, absolute motion safety, i.e. such that no collision will ever take place whatever happens, is impossible to guarantee. It is therefore settled for a weaker level of motion safety dubbed passive motion safety: it guarantees that, if a collision takes place, the robot will be at rest. Passive motion safety is tackled using a variant of the Inevitable Collision State (ICS) concept called Braking ICS, i.e. states such that, whatever the future braking trajectory of the robot, a collision occurs before it is at rest. Passive motion safety is readily obtained by avoiding Braking ICS at all times. Building upon an existing Braking ICS-Checker, i.e. an algorithm that checks if a given state is a Braking ICS or not, this paper presents a reactive collision avoidance scheme called PASSAVOID. The main contribution of this paper is the formal proof of PASSAVOID's passive motion safety. Experiments in simulation demonstrates how PASSAVOID operates.
Abstract-This paper addresses the problem of planning the motion of a mobile robot with a limited sensory field-of-view in an unknown dynamic environment. In such a situation, the upper-bounded planning time prevents from computing a complete motion to the goal, partial motion planning is in order. Besides the presence of moving obstacles whose future behaviour is unknown precludes absolute motion safety (in the sense that no collision will ever take place whatever happens) is impossible to guarantee. The stance taken herein is to settle for a weaker level of motion safety called passive motion safety: it guarantees that, if a collision takes place, the robot will be at rest. The primary contribution of this paper is PASSPMP, a partial motion planner enforcing passive motion safety. PASSPMP periodically computes a passively safe partial trajectory designed to drive the robot towards its goal state. Passive motion safety is handled using a variant of the Inevitable Collision State (ICS) concept called Braking ICS, i.e. states such that, whatever the future braking trajectory of the robot, a collision occurs before it is at rest. Simulation results demonstrate how PASSPMP operates and handles limited sensory field-of-views, occlusions and moving obstacles with unknown future behaviour. More importantly, PASSPMP is provably passively safe.
This paper addresses the problem of navigating a mobile robot with a limited field-of-view in a unknown dynamic environment. In such a situation, absolute motion safety, i.e. such that no collision will ever take place whatever happens, is impossible to guarantee. It is therefore settled for a weaker level of motion safety dubbed passive motion safety: it guarantees that, if a collision takes place, the robot will be at rest. Passive motion safety is tackled using a variant of the Inevitable Collision State (ICS) concept called Braking ICS, i.e. states such that, whatever the future braking trajectory of the robot, a collision occurs before it is at rest. Passive motion safety is readily obtained by avoiding Braking ICS at all times. Building upon an existing Braking ICS-Checker, i.e. an algorithm that checks if a given state is a Braking ICS or not, this paper presents a reactive collision avoidance scheme called PASSAVOID. The main contribution of this paper is the formal proof of PASSAVOID's passive motion safety. Experiments in simulation demonstrates how PASSAVOID operates.
Abstract-This paper addresses the problem of provably safe navigation for a mobile robot with a limited field-ofview placed in a unknown dynamic environment. In such a situation, absolute motion safety (in the sense that no collision will ever take place whatever happens in the environment) is impossible to guarantee in general. It is therefore settled for a weaker level of motion safety dubbed passive motion safety: it guarantees that, if a collision is inevitable, the robot will be at rest. The primary contribution of this paper is a relaxation of the Inevitable Collision State (ICS) concept called Braking ICS. A Braking ICS is a state for which, no matter what the future trajectory of the robot is, it is impossible to stop before a collision takes place. Braking ICS are designed with a passive motion safety perspective for robots with a limited field-of-view in unknown dynamic environments. Braking ICS are formally defined and a number of important properties are established. These properties are then used to design a Braking ICS checker, i.e. an algorithm that checks whether a given state is a Braking ICS or not. In a companion paper, it is shown how the Braking ICS checker can be integrated into a reactive navigation scheme whose passive motion safety is provably guaranteed.
In this paper, an evolutionary scan-matching approach is proposed to solve an optimization issue in simultaneous localization and mapping (SLAM). A rich literature has been invested in this direction, however, most of the proposed approaches lack fast convergence and simplicity regarding the optimization process, which should directly affect the accuracy of the environment's map and the estimated pose. It is a line of research that is always active, offering various solutions to this issue. Among many SLAM methods, the normal distributions transform approach (NDT) has shown high performances, where numerous works have been published up to date and many studies demonstrate its efficiency wrt other methods. Nevertheless, few works have been interested to solve the optimization issue. The proposed solution is based on NDT scanmatching using particle swarm optimization (PSO) and it is dubbed NDT-PSO. The main contribution is to solve the pose estimation problem based on PSO and iterative NDT maps. The performances of the NDT-PSO approach have been proven in real experiments performed on a car-like mobile robot in both static and dynamic environments. NDT-PSO is tested for different swarm sizes, and the results show that 70 particles are more than enough to find the best particle while avoiding local minima even in loop closing. The algorithm is also suitable for real time applications, with an average runnnig time of 145ms for 70 particles and 70 iterations of the optimization process. This value can be further reduced using fewer particles and iterations. The accuracy of the proposed approach is also evaluated wrt other SLAM methods widely used among the robot operating system community and it has been shown that NDT-PSO outperforms these algorithms.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.