The Colliding Reciprocal Dance Problem: A Mitigation Strategy with Application to Automotive Active Safety Systems

  title={The Colliding Reciprocal Dance Problem: A Mitigation Strategy with Application to Automotive Active Safety Systems},
  author={J. Johnson},
  journal={2020 American Control Conference (ACC)},
  • J. Johnson
  • Published 19 September 2019
  • Computer Science, Engineering
  • 2020 American Control Conference (ACC)
A reciprocal dance occurs when two mobile agents attempt to pass each other but incompatible interaction models result in repeated attempts to take mutually blocking actions. Such a situation often results in deadlock, but in systems with significant inertial constraints, it can result in collision. This paper presents this colliding variant of the reciprocal dance, how it arises, and a mitigation strategy that can improve safety without sacrificing flexibility. A demonstration is provided in… Expand
Sense–Assess–eXplain (SAX): Building Trust in Autonomous Vehicles in Challenging Real-World Driving Scenarios
This paper presents how to build robots that can robustly sense and interpret their environment using traditional as well as unconventional sensors; can assess their own capabilities; and can provide causal explanations of their interpretations and assessments. Expand


Reciprocal collision avoidance with acceleration-velocity obstacles
This work introduces the acceleration-velocity obstacle (AVO) to let a robot avoid collisions with moving obstacles while obeying acceleration constraints, and extends this concept to reciprocal collision avoidance for multi-robot settings, by letting each robot take half of the responsibility of avoiding pairwise collisions. Expand
The dynamic window approach to collision avoidance
This approach, designed for mobile robots equipped with synchro-drives, is derived directly from the motion dynamics of the robot and safely controlled the mobile robot RHINO in populated and dynamic environments. Expand
Optimal trajectory generation for dynamic street scenarios in a Frenét Frame
A semi-reactive trajectory generation method, which can be tightly integrated into the behavioral layer of the holistic autonomous system, that realizes long-term objectives such as velocity keeping, merging, following, stopping, in combination with a reactive collision avoidance by means of optimal-control strategies within the Frenét-Frame of the street. Expand
Autonomous golf cars for public trial of mobility-on-demand service
The hardware and software components of the golf cars used in public trials in Singapore's Chinese and Japanese Gardens were designed to be robust, reliable, and safe, while operating under prolonged durations. Expand
Motion Planning in Dynamic Environments Using Velocity Obstacles
This paper presents a method for robot motion planning in dynamic environments. It consists of selecting avoidance maneuvers to avoid static and moving obstacles in the velocity space, based on theExpand
Approximate solutions for partially observable stochastic games with common payoffs
This work proposes an algorithm that approximates POSGs as a series of smaller, related Bayesian games, using heuristics such as QMDP to provide the future discounted value of actions, and results in policies that are locally optimal with respect to the selected heuristic. Expand
ROS: an open-source Robot Operating System
This paper discusses how ROS relates to existing robot software frameworks, and briefly overview some of the available application software which uses ROS. Expand
Pre-Crash Scenario Typology for Crash Avoidance Research
This report defines a new pre-crash scenario typology for crash avoidance research based on the 2004 General Estimates System (GES) crash database, which consists of pre-crash scenarios depictingExpand
High-speed flight in an ergodic forest
Novel connections between robot motion planning and statistical physics through ergodic theory and the theory of percolation are established, which may be of independent interest. Expand
Competition Adds Complexity
It is shown that, for competitive POSGs, the complexity of determining whether one team has a positive-expected-reward strategy is complete for NEXPNP. Expand