269 research outputs found
Active Localization of Gas Leaks using Fluid Simulation
Sensors are routinely mounted on robots to acquire various forms of
measurements in spatio-temporal fields. Locating features within these fields
and reconstruction (mapping) of the dense fields can be challenging in
resource-constrained situations, such as when trying to locate the source of a
gas leak from a small number of measurements. In such cases, a model of the
underlying complex dynamics can be exploited to discover informative paths
within the field. We use a fluid simulator as a model, to guide inference for
the location of a gas leak. We perform localization via minimization of the
discrepancy between observed measurements and gas concentrations predicted by
the simulator. Our method is able to account for dynamically varying parameters
of wind flow (e.g., direction and strength), and its effects on the observed
distribution of gas. We develop algorithms for off-line inference as well as
for on-line path discovery via active sensing. We demonstrate the efficiency,
accuracy and versatility of our algorithm using experiments with a physical
robot conducted in outdoor environments. We deploy an unmanned air vehicle
(UAV) mounted with a CO2 sensor to automatically seek out a gas cylinder
emitting CO2 via a nozzle. We evaluate the accuracy of our algorithm by
measuring the error in the inferred location of the nozzle, based on which we
show that our proposed approach is competitive with respect to state of the art
baselines.Comment: Accepted as a journal paper at IEEE Robotics and Automation Letters
(RA-L
Intelligent Robotic Perception Systems
Robotic perception is related to many applications in robotics where sensory data and artificial intelligence/machine learning (AI/ML) techniques are involved. Examples of such applications are object detection, environment representation, scene understanding, human/pedestrian detection, activity recognition, semantic place classification, object modeling, among others. Robotic perception, in the scope of this chapter, encompasses the ML algorithms and techniques that empower robots to learn from sensory data and, based on learned models, to react and take decisions accordingly. The recent developments in machine learning, namely deep-learning approaches, are evident and, consequently, robotic perception systems are evolving in a way that new applications and tasks are becoming a reality. Recent advances in human-robot interaction, complex robotic tasks, intelligent reasoning, and decision-making are, at some extent, the results of the notorious evolution and success of ML algorithms. This chapter will cover recent and emerging topics and use-cases related to intelligent perception systems in robotics
Human Motion Trajectory Prediction: A Survey
With growing numbers of intelligent autonomous systems in human environments,
the ability of such systems to perceive, understand and anticipate human
behavior becomes increasingly important. Specifically, predicting future
positions of dynamic agents and planning considering such predictions are key
tasks for self-driving vehicles, service robots and advanced surveillance
systems. This paper provides a survey of human motion trajectory prediction. We
review, analyze and structure a large selection of work from different
communities and propose a taxonomy that categorizes existing methods based on
the motion modeling approach and level of contextual information used. We
provide an overview of the existing datasets and performance metrics. We
discuss limitations of the state of the art and outline directions for further
research.Comment: Submitted to the International Journal of Robotics Research (IJRR),
37 page
What’s in it for me? Incentive-compatible route coordination of crowdsourced resources
With the recent trend in crowdsourcing, i.e., using the power of crowds to assist in satisfying demand, the pool of resources suitable for GeoPresence-capable systems has expanded to include already roaming devices, such as mobile phones, and moving vehicles. We envision an environment, in which the motion of these crowdsourced mobile resources is coordinated, according to their preexisting schedules to satisfy geo-temporal demand on a mobility field. In this paper, we propose an incentive compatible route coordination mechanism for crowdsourced resources, in which participating mobile agents satisfy geo-temporal requests in return for monetary rewards. We define the Flexible Route Coordination (FRC) problem, in which an agent’s flexibility is exploited to maximize the coverage of a mobility field, with an objective to maximize the revenue collected from satisfied paying requests. Given that the FRC problem is NP-hard, we define an optimal algorithm to plan the route of a single agent on a graph with evolving labels, then we use that algorithm to define a 1/2-approximation algorithm to solve the problem in its general model, with multiple agents. Moreover, we define an incentive compatible, rational, and cash-positive payment mechanism, which guarantees that an agent’s truthfulness about its flexibility is an ex-post Nash equilibrium strategy. Finally, we analyze the proposed mechanisms theoretically, and evaluate their performance experimentally using real mobility traces from urban environments.Supported in part by NSF Grants, #1430145, #1414119, #1347522, #1239021, and #1012798
Incentive-compatible route coordination of crowdsourced resources
Technical ReportWith the recent trend in crowdsourcing, i.e., using the power of crowds to assist in satisfying demand, the pool of resources suitable for GeoPresen-ce-capable systems has expanded to include already roaming devices, such as mobile phones, and moving vehicles. We envision an environment, in
which the motion of these crowdsourced mobile resources is coordinated, according to their preexisting schedules to satisfy geo-temporal demand on a mobility field. In this paper, we propose an incentive compatible route coordination mechanism for crowdsourced resources, in which participating mobile agents satisfy geo-temporal requests in return for monetary rewards. We define the Flexible Route Coordination (FRC) problem, in which an agent’s flexibility is exploited to maximize the coverage of a
mobility field, with an objective to maximize the revenue collected from satisfied paying requests. Given that the FRC problem is NP-hard, we define an optimal algorithm to plan the route of a single agent on a graph with evolving labels, then we use that algorithm to define a 1-approximation algorithm to solve the 2 problem in its general model, with multiple agents. Moreover, we define an incentive compatible, rational, and cash-positive payment mechanism, which guarantees that an agent’s truthfulness about its flexibility is an ex-post Nash equilibrium strategy. Finally, we analyze the proposed mechanisms theoretically, and evaluate their performance experimentally using real mobility traces from urban environments
Online planning for multi-robot active perception with self-organising maps
© 2017, Springer Science+Business Media, LLC, part of Springer Nature. We propose a self-organising map (SOM) algorithm as a solution to a new multi-goal path planning problem for active perception and data collection tasks. We optimise paths for a multi-robot team that aims to maximally observe a set of nodes in the environment. The selected nodes are observed by visiting associated viewpoint regions defined by a sensor model. The key problem characteristics are that the viewpoint regions are overlapping polygonal continuous regions, each node has an observation reward, and the robots are constrained by travel budgets. The SOM algorithm jointly selects and allocates nodes to the robots and finds favourable sequences of sensing locations. The algorithm has a runtime complexity that is polynomial in the number of nodes to be observed and the magnitude of the relative weighting of rewards. We show empirically the runtime is sublinear in the number of robots. We demonstrate feasibility for the active perception task of observing a set of 3D objects. The viewpoint regions consider sensing ranges and self-occlusions, and the rewards are measured as discriminability in the ensemble of shape functions feature space. Exploration objectives for online tasks where the environment is only partially known in advance are modelled by introducing goal regions in unexplored space. Online replanning is performed efficiently by adapting previous solutions as new information becomes available. Simulations were performed using a 3D point-cloud dataset from a real robot in a large outdoor environment. Our results show the proposed methods enable multi-robot planning for online active perception tasks with continuous sets of candidate viewpoints and long planning horizons
- …