• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Dynamic obstacle avoidance in uncertain environment combining pvos and occupancy grid,” in ICRA, (2007)

by C Fulgenzi
Add To MetaCart

Tools

Sorted by:
Results 1 - 10 of 29
Next 10 →

Reciprocal Velocity Obstacles for Real-Time Multi-Agent Navigation

by Jur van den Berg, Ming C. Lin, Dinesh Manocha - IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION , 2008
"... In this paper, we propose a new concept - the "Reciprocal Velocity Obstacle" - for real-time multi-agent navigation. We consider the case in which each agent navigates independently without explicit communication with other agents. Our formulation is an extension of the Velocity Obstacle c ..."
Abstract - Cited by 104 (22 self) - Add to MetaCart
In this paper, we propose a new concept - the "Reciprocal Velocity Obstacle" - for real-time multi-agent navigation. We consider the case in which each agent navigates independently without explicit communication with other agents. Our formulation is an extension of the Velocity Obstacle concept, which was introduced for navigation among (passively) moving obstacles. Our approach takes into account the reactive behavior of the other agents by implicitly assuming that the other agents make a similar collision-avoidance reasoning. We show that this method guarantees safe and oscillationfree motions for each of the agents. We apply our concept to navigation of hundreds of agents in densely populated environments containing both static and moving obstacles, and we show that real-time and scalable performance is achieved in such challenging scenarios.

Reciprocal n-body Collision Avoidance

by Jur van den Berg, Stephen J. Guy, Ming C. Lin, Dinesh Manocha - INTERNATIONAL SYMPOSIUM ON ROBOTICS RESEARCH , 2009
"... In this paper, we present a formal approach to reciprocal n-body collision avoidance, where multiple mobile robots need to avoid collisions with each other while moving in a common workspace. In our formulation, each robot acts fully independently, and does not communicate with other robots. Based o ..."
Abstract - Cited by 65 (22 self) - Add to MetaCart
In this paper, we present a formal approach to reciprocal n-body collision avoidance, where multiple mobile robots need to avoid collisions with each other while moving in a common workspace. In our formulation, each robot acts fully independently, and does not communicate with other robots. Based on the definition of velocity obstacles, we derive sufficient conditions for collision-free motion by reducing the problem to solving a low-dimensional linear program. We test our approach on several dense and complex simulation scenarios involving thousands of robots and compute collision-free actions for all of them in only a few milliseconds. To the best of our knowledge, this method is the first that can guarantee local collision-free motion for a large number of robots in a cluttered workspace.
(Show Context)

Citation Context

... taken into account. This problem is generally referred to as “asteroid avoidance”, and approaches typically extrapolate the observed velocities in order to estimate the future positions of obstacles =-=[8, 9, 12, 19, 21, 27]-=-. The problem of collision avoidance becomes harder when the obstacles are not simply moving without considering their environment, but are also intelligent decision-making entities that try to avoid ...

ClearPath: Highly Parallel Collision Avoidance for Multi-Agent Simulation

by Stephen J. Guy, Jatin Chhugani, Changkyu Kim, Nadathur Satish, Ming C. Lin, Dinesh Manocha, Pradeep Dubey - ACM SIGGRAPH/EUROGRAPHICS SYMPOSIUM ON COMPUTER ANIMATION , 2009
"... We present a new local collision avoidance algorithm between multiple agents for real-time simulations. Our approach extends the notion of velocity obstacles from robotics and formulates the conditions for collision free navigation as a quadratic optimization problem. We use a discrete optimization ..."
Abstract - Cited by 44 (11 self) - Add to MetaCart
We present a new local collision avoidance algorithm between multiple agents for real-time simulations. Our approach extends the notion of velocity obstacles from robotics and formulates the conditions for collision free navigation as a quadratic optimization problem. We use a discrete optimization method to efficiently compute the motion of each agent. This resulting algorithm can be parallelized by exploiting data-parallelism and thread-level parallelism. The overall approach, ClearPath, is general and can robustly handle dense scenarios with tens or hundreds of thousands of heterogeneous agents in a few milli-seconds. As compared to prior collision avoidance algorithms, we observe more than an order of magnitude performance improvement.

Robotic motion planning in dynamic, cluttered, uncertain environments

by Noel E. Du Toit, Noel E. Du Toit, Iamexceedinglygratefultodr Richardmurrayforhismentorshipandcommitmentduring - In ICRA , 2010
"... Aan my Ouers, vir hulle eindelose inspirasie, opoffering, liefde, en ondersteuning. To my Parents, for their endless inspiration, sacrifice, love, and support. iv Acknowledgments I wish to extend my gratitude to the various people who have contributed to my graduate career and to making it a rewardi ..."
Abstract - Cited by 26 (0 self) - Add to MetaCart
Aan my Ouers, vir hulle eindelose inspirasie, opoffering, liefde, en ondersteuning. To my Parents, for their endless inspiration, sacrifice, love, and support. iv Acknowledgments I wish to extend my gratitude to the various people who have contributed to my graduate career and to making it a rewarding and constructive experience: Abigthankyoutomyadvisor,Dr. JoelBurdick,forhismentorship,encouragement,understanding, and unwaivering support. Your commitment to your students and family truly is an inspiration.
(Show Context)

Citation Context

... and a local planner reacts to the dynamic component of the environment [17, 18, 35]. One attempt to extend the local planner to uncertain environments is the Probabilistic Velocity Obstacle approach =-=[26]-=-, where uncertainty associated with the obstacle geometry and velocity vector is used to artificially grow the velocity obstacle in an open-loop fashion. Planning algorithms for stochastic systems hav...

The Hybrid Reciprocal Velocity Obstacle

by Jamie Snape, Jur van den Berg, Stephen J. Guy, Dinesh Manocha - IEEE TRANSACTIONS ON ROBOTICS , 2011
"... We present the hybrid reciprocal velocity obstacle for collision-free and oscillation-free navigation of multiple mobile robots or virtual agents. Each robot senses its surroundings and acts independently without central coordination or communication with other robots. Our approach uses both the cur ..."
Abstract - Cited by 17 (3 self) - Add to MetaCart
We present the hybrid reciprocal velocity obstacle for collision-free and oscillation-free navigation of multiple mobile robots or virtual agents. Each robot senses its surroundings and acts independently without central coordination or communication with other robots. Our approach uses both the current position and the velocity of other robots to compute their future trajectories in order to avoid collisions. Moreover, our approach is reciprocal and avoids oscillations by explicitly taking into account that the other robots also sense their surroundings and change their trajectories accordingly. We apply hybrid reciprocal velocity obstacles to iRobot Create mobile robots and demonstrate direct, collision-free, and oscillation-free navigation.

Detection, Prediction, and Avoidance of Dynamic Obstacles in Urban Environments

by Dave Ferguson, Michael Darms, Chris Urmson, Sascha Kolski
"... Abstract — We present an approach for robust detection, prediction, and avoidance of dynamic obstacles in urban environments. After detecting a dynamic obstacle, our approach exploits structure in the environment where possible to generate a set of likely hypotheses for the future behavior of the ob ..."
Abstract - Cited by 15 (4 self) - Add to MetaCart
Abstract — We present an approach for robust detection, prediction, and avoidance of dynamic obstacles in urban environments. After detecting a dynamic obstacle, our approach exploits structure in the environment where possible to generate a set of likely hypotheses for the future behavior of the obstacle and efficiently incorporates these hypotheses into the planning process to produce safe actions. The techniques presented are very general and can be used with a wide range of sensors and planning algorithms. We present results from an implementation on an autonomous passenger vehicle that has traveled thousands of miles in populated urban environments and won first place in the DARPA Urban Challenge. I.
(Show Context)

Citation Context

...a notion of uncertainty in the future behavior of other vehicles through probabilistic trajectory models, but these too are heavily biased towards the vehicles continuing their exact current behavior =-=[10]-=-. Sometimes, such models are the best we can do as we have no additional information to draw upon, but in structured environments such as roads and intersections we can exploit this structure to gener...

Independent Navigation of Multiple Mobile Robots with Hybrid Reciprocal Velocity Obstacles

by Jamie Snape, Jur van den Berg, Stephen J. Guy, Dinesh Manocha - IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS , 2009
"... We present an approach for smooth and collision-free navigation of multiple mobile robots amongst each other. Each robot senses its surroundings and acts independently without central coordination or communication with other robots. Our approach uses both the current position and the velocity of oth ..."
Abstract - Cited by 14 (4 self) - Add to MetaCart
We present an approach for smooth and collision-free navigation of multiple mobile robots amongst each other. Each robot senses its surroundings and acts independently without central coordination or communication with other robots. Our approach uses both the current position and the velocity of other robots to predict their future trajectory in order to avoid collisions. Moreover, our approach is reciprocal and avoids oscillations by explicitly taking into account that the other robots also sense their surroundings and change their trajectories accordingly. We build on prior work related to velocity obstacles and reciprocal velocity obstacles and introduce the concept of hybrid reciprocal velocity obstacles (HRVO) for collision avoidance that takes into account the kinematics of the robots and uncertainty in sensor data. We apply our approach to a set of iRobot Create robots using centralized sensing and show natural, direct, and collision-free navigation in several challenging scenarios.
(Show Context)

Citation Context

...lly by attempting to incorporate the reactive behavior of the other entities in the environment. Variations such as reciprocal velocity obstacles [6], [12], recursive probabilistic velocity obstacles =-=[13]-=-, [14], and common velocity obstacles [15] use various means to handle reciprocity, but each have their own shortcomings. Specifically, the approach of [14] may fail to converge, while other concepts ...

Probabilistic mapping of dynamic obstacles using markov chains for replanning in dynamic environments

by Florian Rohrmüller, Matthias Althoff, Dirk Wollherr, Martin Buss - In Proc. of the IEEE/RSJ International Conference on Intelligent Robots and Systems , 2008
"... Abstract — Robots acting in populated environments must be capable of safe but also time efficient navigation. Trying to completely avoid regions resulting from worst case predictions of the obstacle dynamics may leave no free space for a robot to move, especially in environments with high dynamic. ..."
Abstract - Cited by 13 (11 self) - Add to MetaCart
Abstract — Robots acting in populated environments must be capable of safe but also time efficient navigation. Trying to completely avoid regions resulting from worst case predictions of the obstacle dynamics may leave no free space for a robot to move, especially in environments with high dynamic. This work presents an algorithm for a ”soft ” risk mapping of dynamic objects leaving the complete space free of static objects for path planning. Markov Chains are used to model the dynamics of moving persons and predict their potential future locations. These occlusion estimations are mapped into risk regions which serve to plan a path through potentially obstructed space searching for the trade-off between detour and time delay. The offline computation of the Markov Chain model keeps the computational effort low, making the approach suitable for online applications. I.
(Show Context)

Citation Context

...he set of colliding relative velocities between robot and moving object. Under the assumption of constant velocities, any relative velocity within the VO is causing a collision. The VO is extended in =-=[13]-=- by a probabilistic version (PVO), where the perception system is modeled probabilistically while the obstacle model itself remains deterministic. Modeling of dynamic obstacles is also extensively cov...

Reciprocal collision avoidance with acceleration-velocity obstacles.

by Jur Van Den Berg , Jamie Snape , Stephen J Guy , Dinesh Manocha - In IEEE International Conference on Robotics and Automation, ICRA 2011, , 2011
"... Abstract-We present an approach for collision avoidance for mobile robots that takes into account acceleration constraints. We discuss both the case of navigating a single robot among moving obstacles, and the case of multiple robots reciprocally avoiding collisions with each other while navigating ..."
Abstract - Cited by 12 (3 self) - Add to MetaCart
Abstract-We present an approach for collision avoidance for mobile robots that takes into account acceleration constraints. We discuss both the case of navigating a single robot among moving obstacles, and the case of multiple robots reciprocally avoiding collisions with each other while navigating a common workspace. Inspired by the concept of velocity obstacles [3], we introduce the acceleration-velocity obstacle (AVO) to let a robot avoid collisions with moving obstacles while obeying acceleration constraints. AVO characterizes the set of new velocities the robot can safely reach and adopt using proportional control of the acceleration. We extend this concept to reciprocal collision avoidance for multi-robot settings, by letting each robot take half of the responsibility of avoiding pairwise collisions. Our formulation guarantees collision-free navigation even as the robots act independently and simultaneously, without coordination. Our approach is designed for holonomic robots, but can also be applied to kinematically constrained non-holonomic robots such as cars. We have implemented our approach, and we show simulation results in challenging environments with large numbers of robots and obstacles.
(Show Context)

Citation Context

...s what may be a safe escape maneuver with respect to one obstacle may be a collision course with respect to another obstacle. In [13], velocity obstacles are defined for the special case of a car-like robot that controls its speed and turning radius, and incorporates second-order constraints on the speed. Other related concepts include non-linear velocity obstacles [16] and generalized velocity obstacles [20]. The former accounts for higher-order motion of obstacles, while the latter defines “control input obstacles” for kinematically constrained robots. The probabilistic velocity obstacle of [6] addresses uncertainty in the future trajectory of obstacles. Existing approaches that address reciprocal collision avoidance include [1], [17], [10], [18]. The approach of [19] guarantees collision avoidance for multiple robots. However, none of these approaches deal with acceleration constraints. We will combine the approach of [19] with accelerationvelocity obstacles to guarantee collision-free navigation of multiple robots subject to acceleration constraints. A. Notation We will use the following notational convention in this paper: Scalars x are set in lower case italics, vectors x in low...

Robot navigation in dense human crowds: the case for cooperation

by Peter Trautman , Jeremy Ma , Richard M Murray , Andreas Krause - in Proceedings of the IEEE International Conference on Robotics and Automation
"... Abstract-We consider mobile robot navigation in dense human crowds. In particular, we explore two questions. Can we design a navigation algorithm that encourages humans to cooperate with a robot? Would such cooperation improve navigation performance? We address the first question by developing a pr ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
Abstract-We consider mobile robot navigation in dense human crowds. In particular, we explore two questions. Can we design a navigation algorithm that encourages humans to cooperate with a robot? Would such cooperation improve navigation performance? We address the first question by developing a probabilistic predictive model of cooperative collision avoidance and goal-oriented behavior by extending the interacting Gaussian processes approach to include multiple goals and stochastic movement duration. We answer the second question with an extensive quantitative study of robot navigation in dense human crowds (488 runs completed), specifically testing how cooperation models effect navigation performance. We find that the "multiple goal" interacting Gaussian processes algorithm performs comparably with human teleoperators in crowd densities near 1 person/m 2 , while a state of the art noncooperative planner exhibits unsafe behavior more than 3 times as often as this multiple goal extension, and more than twice as often as the basic interacting Gaussian processes. Furthermore, a reactive planner based on the widely used "dynamic window" approach fails for crowd densities above 0.55 people/m 2 . Based on these experimental results, and previous theoretical observations, we conclude that a cooperation model is important for safe and efficient robot navigation in dense human crowds.
(Show Context)

Citation Context

...leoperator exceeded that of the autonomous navigation algorithm. C. Description of Untested Navigation Algorithms We survey existing navigation approaches and explain why our test algorithms are sufficiently representative. Inevitable collision states (ICS) are limited to deterministic settings, and so are inapplicable. Probabilistic ICS ([35]) is designed to handle predictive uncertainty. However, Probabilistic ICS is a special case of [14], and so V-B.1 (our noncooperative planner) is representative. Velocity obstacles (VOs) are limited to deterministic scenarios, and thus inappropriate. In [36], VOs are generalized for noise. However, Probabilistic VOs use linear extrapolation, and so V-B.1 is representative. We tested reciprocal velocity obstacles (RVOs, [37]). However, noisy pedestrian tracks caused RVO to behave erratically (unresponsive to a single person walking directly at the robot), and RVO assumes all agents choose velocities in a pre-specified manner, which is untrue for humans. Furthermore, we adjusted the value of the collision cone to be less aggressive; nevertheless, RVO still struggled with natural human environments. Although other modifications may indeed make this ...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University