Detection and Tracking of Moving Obstacles (DATMO): A Review

Robotica ◽  
2019 ◽  
Vol 38 (5) ◽  
pp. 761-774 ◽  
Author(s):  
Ángel Llamazares ◽  
Eduardo J. Molinos ◽  
Manuel Ocaña

SummaryWorking with mobile robots, prior to execute the local planning stage, they must know the environment where they are moving. For that reason the perception and mapping stages must be performed previously. This paper presents a survey in the state of the art in detection and tracking of moving obstacles (DATMO). The aim of what follows is to provide an overview of the most remarkable methods at each field specially in indoor environments where dynamic obstacles can be potentially more dangerous and unpredictable. We are going to show related DATMO methods organized in three approaches: model-free, model-based and grid-based. In addition, a comparison between them and conclusions will be presented.

Sensors ◽  
2019 ◽  
Vol 19 (6) ◽  
pp. 1474 ◽  
Author(s):  
Muhammad Sualeh ◽  
Gon-Woo Kim

Environmental perception plays an essential role in autonomous driving tasks and demands robustness in cluttered dynamic environments such as complex urban scenarios. In this paper, a robust Multiple Object Detection and Tracking (MODT) algorithm for a non-stationary base is presented, using multiple 3D LiDARs for perception. The merged LiDAR data is treated with an efficient MODT framework, considering the limitations of the vehicle-embedded computing environment. The ground classification is obtained through a grid-based method while considering a non-planar ground. Furthermore, unlike prior works, 3D grid-based clustering technique is developed to detect objects under elevated structures. The centroid measurements obtained from the object detection are tracked using Interactive Multiple Model-Unscented Kalman Filter-Joint Probabilistic Data Association Filter (IMM-UKF-JPDAF). IMM captures different motion patterns, UKF handles the nonlinearities of motion models, and JPDAF associates the measurements in the presence of clutter. The proposed algorithm is implemented on two slightly dissimilar platforms, giving real-time performance on embedded computers. The performance evaluation metrics by MOT16 and ground truths provided by KITTI Datasets are used for evaluations and comparison with the state-of-the-art. The experimentation on platforms and comparisons with state-of-the-art techniques suggest that the proposed framework is a feasible solution for MODT tasks.


Robotica ◽  
2021 ◽  
pp. 1-18
Author(s):  
Majid Yekkehfallah ◽  
Ming Yang ◽  
Zhiao Cai ◽  
Liang Li ◽  
Chuanxiang Wang

SUMMARY Localization based on visual natural landmarks is one of the state-of-the-art localization methods for automated vehicles that is, however, limited in fast motion and low-texture environments, which can lead to failure. This paper proposes an approach to solve these limitations with an extended Kalman filter (EKF) based on a state estimation algorithm that fuses information from a low-cost MEMS Inertial Measurement Unit and a Time-of-Flight camera. We demonstrate our results in an indoor environment. We show that the proposed approach does not require any global reflective landmark for localization and is fast, accurate, and easy to use with mobile robots.


2021 ◽  
Author(s):  
Luigi Tagliavini ◽  
Andrea Botta ◽  
Luca Carbonari ◽  
Giuseppe Quaglia ◽  
Dario Gandini ◽  
...  

Abstract In this paper, a novel mobile platform for assistive robotics tasks is presented. The machine is designed for working in a home environment, un-structured and possibly occupied by people. To work in this space, the platform must be able to get rid of all the consequent difficulties: to overpass small objects as steps and carpets, to operate with an as-high-as-possible dynamics, to avoid moving obstacles, and to navigate autonomously to track persons for person monitoring purposes. The proposed platform is designed to have an omni-directional mobility that improves the manoeuvrability with respect to state-of-the-art differential drive robots. It also will have a non-axisymmetric shape to easily navigate narrow spaces, and real-time edge computing algorithms for navigation. This work shows the design paradigm adopted for the realization of a novel mobile robot, named Paquitop. For a robust output, the design process used a modular approach which disjointed the several sub-systems which compose the machine. After a brief analysis of the expected features, a set of basic requirements are drawn to guide the functional and executive design. The overall architecture of the platform is presented, together with some details on the mechanical and electrical systems.


2022 ◽  
pp. 1-12
Author(s):  
Shuailong Li ◽  
Wei Zhang ◽  
Huiwen Zhang ◽  
Xin Zhang ◽  
Yuquan Leng

Model-free reinforcement learning methods have successfully been applied to practical applications such as decision-making problems in Atari games. However, these methods have inherent shortcomings, such as a high variance and low sample efficiency. To improve the policy performance and sample efficiency of model-free reinforcement learning, we propose proximal policy optimization with model-based methods (PPOMM), a fusion method of both model-based and model-free reinforcement learning. PPOMM not only considers the information of past experience but also the prediction information of the future state. PPOMM adds the information of the next state to the objective function of the proximal policy optimization (PPO) algorithm through a model-based method. This method uses two components to optimize the policy: the error of PPO and the error of model-based reinforcement learning. We use the latter to optimize a latent transition model and predict the information of the next state. For most games, this method outperforms the state-of-the-art PPO algorithm when we evaluate across 49 Atari games in the Arcade Learning Environment (ALE). The experimental results show that PPOMM performs better or the same as the original algorithm in 33 games.


Sensors ◽  
2019 ◽  
Vol 19 (20) ◽  
pp. 4595 ◽  
Author(s):  
Clara Gomez ◽  
Alejandra C. Hernandez ◽  
Ramon Barber

Exploration of unknown environments is a fundamental problem in autonomous robotics that deals with the complexity of autonomously traversing an unknown area while acquiring the most important information of the environment. In this work, a mobile robot exploration algorithm for indoor environments is proposed. It combines frontier-based concepts with behavior-based strategies in order to build a topological representation of the environment. Frontier-based approaches assume that, to gain the most information of an environment, the robot has to move to the regions on the boundary between open space and unexplored space. The novelty of this work is in the semantic frontier classification and frontier selection according to a cost–utility function. In addition, a probabilistic loop closure algorithm is proposed to solve cyclic situations. The system outputs a topological map of the free areas of the environment for further navigation. Finally, simulated and real-world experiments have been carried out, their results and the comparison to other state-of-the-art algorithms show the feasibility of the exploration algorithm proposed and the improvement that it offers with regards to execution time and travelled distance.


2020 ◽  
Vol 69 ◽  
pp. 471-500
Author(s):  
Shih-Yun Lo ◽  
Shiqi Zhang ◽  
Peter Stone

Intelligent mobile robots have recently become able to operate autonomously in large-scale indoor environments for extended periods of time. In this process, mobile robots need the capabilities of both task and motion planning. Task planning in such environments involves sequencing the robot’s high-level goals and subgoals, and typically requires reasoning about the locations of people, rooms, and objects in the environment, and their interactions to achieve a goal. One of the prerequisites for optimal task planning that is often overlooked is having an accurate estimate of the actual distance (or time) a robot needs to navigate from one location to another. State-of-the-art motion planning algorithms, though often computationally complex, are designed exactly for this purpose of finding routes through constrained spaces. In this article, we focus on integrating task and motion planning (TMP) to achieve task-level-optimal planning for robot navigation while maintaining manageable computational efficiency. To this end, we introduce TMP algorithm PETLON (Planning Efficiently for Task-Level-Optimal Navigation), including two configurations with different trade-offs over computational expenses between task and motion planning, for everyday service tasks using a mobile robot. Experiments have been conducted both in simulation and on a mobile robot using object delivery tasks in an indoor office environment. The key observation from the results is that PETLON is more efficient than a baseline approach that pre-computes motion costs of all possible navigation actions, while still producing plans that are optimal at the task level. We provide results with two different task planning paradigms in the implementation of PETLON, and offer TMP practitioners guidelines for the selection of task planners from an engineering perspective.


2020 ◽  
Vol 34 (04) ◽  
pp. 3316-3323
Author(s):  
Qingpeng Cai ◽  
Ling Pan ◽  
Pingzhong Tang

Reinforcement learning algorithms such as the deep deterministic policy gradient algorithm (DDPG) has been widely used in continuous control tasks. However, the model-free DDPG algorithm suffers from high sample complexity. In this paper we consider the deterministic value gradients to improve the sample efficiency of deep reinforcement learning algorithms. Previous works consider deterministic value gradients with the finite horizon, but it is too myopic compared with infinite horizon. We firstly give a theoretical guarantee of the existence of the value gradients in this infinite setting. Based on this theoretical guarantee, we propose a class of the deterministic value gradient algorithm (DVG) with infinite horizon, and different rollout steps of the analytical gradients by the learned model trade off between the variance of the value gradients and the model bias. Furthermore, to better combine the model-based deterministic value gradient estimators with the model-free deterministic policy gradient estimator, we propose the deterministic value-policy gradient (DVPG) algorithm. We finally conduct extensive experiments comparing DVPG with state-of-the-art methods on several standard continuous control benchmarks. Results demonstrate that DVPG substantially outperforms other baselines.


Author(s):  
Rosa Romano

The Smart Skin Envelope research analyses the recent revolution that has taken place in the sector of planning and production of smart skin components, made up of dynamic layers. The aim is to identify the technological, functional, qualitative and performance parameters that guide the decisions of the actors in the innovation process. It explores the factors that drive them to develop solutions and proposals designed to transform the envelope of the building from a static to a dynamic element, featuring interoperable components that can interact with the input from the outdoor and indoor environments, in relation to which the smart skin acts as a system of boundary and delimitation. The proposed research programme explores in particular the sector of Smart Envelopes, setting as its priority objective the identification and definition of the energy performance, both through analysis of the state of the art and through the development of a facade component that is dynamic in terms of the adaptive variability of its performance.


Sign in / Sign up

Export Citation Format

Share Document