DAMN : A Distributed Architecture for Mobile Navigation Julio K. Rosenblatt Presented By: Chris Miles.

Slides:



Advertisements
Similar presentations
Lecture 7: Potential Fields and Model Predictive Control
Advertisements

AI Pathfinding Representing the Search Space
Fuzzy Logic and Robot Control Mundhenk and Itti, 2007.
Q3.1 A bicyclist starts at point P and travels around a triangular path that takes her through points Q and R before returning to point P. What is the.
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
FORCE & MOTION.
Lecture 4: Command and Behavior Fusion Gal A. Kaminka Introduction to Robots and Multi-Robot Systems Agents in Physical and Virtual Environments.
Please take out paper for notes!!
Feasible trajectories for mobile robots with kinematic and environment constraints Paper by Jean-Paul Laumond I am Henrik Tidefelt.
By Lydia E. Kavraki, Petr Svestka, Jean-Claude Latombe, Mark H. Overmars Emre Dirican
CSE 380 – Computer Game Programming Pathfinding AI
UNIVERSITY OF JYVÄSKYLÄ Building NeuroSearch – Intelligent Evolutionary Search Algorithm For Peer-to-Peer Environment Master’s Thesis by Joni Töyrylä
Boe-Bot Challenge. Advanced Users (those who have used Boe-Bots in Digital Electronics) There are suggested activities / programs for each challenge.
Chapter 5 Natural Laws and Car Control
The Vector Field Histogram Erick Tryzelaar November 14, 2001 Robotic Motion Planning A Method Developed by J. Borenstein and Y. Koren.
Mixture Designs Simplex Lattice Simplex Centroid
Chapter 5 Worksheets.
Planning under Uncertainty
Nonholonomic Multibody Mobile Robots: Controllability and Motion Planning in the Presence of Obstacles (1991) Jerome Barraquand Jean-Claude Latombe.
Motion Measuring Motion Speed – Average Speed = distance covered / time taken v = d/t metric unit of speed: m/s English unit of speed: ft/s –Constant.
1 Motion Planning Algorithms : BUG-family. 2 To plan a path  find a continuous trajectory leading from initial position of the automaton (a mobile robot)
Using a GA to Create Prey Tactics Presented by Tony Morelli on 11/29/04.
Behavior Coordination Mechanisms – State-of-the- Art Paper by: Paolo Pirjanian (USC) Presented by: Chris Martin.
Autonomous Mobile Robots CPE 470/670 Lecture 8 Instructor: Monica Nicolescu.
Motor Schema Based Navigation for a Mobile Robot: An Approach to Programming by Behavior Ronald C. Arkin Reviewed By: Chris Miles.
29 Palms Vehicle Detection (what we wanted to do).
June 12, 2001 Jeong-Su Han An Autonomous Vehicle for People with Motor Disabilities by G. Bourhis, O.Horn, O.Habert and A. Pruski Paper Review.
 Science Book  Interactive Notebook  Force and Motion Glossary  Pencil  Listening ears.
A Randomized Approach to Robot Path Planning Based on Lazy Evaluation Robert Bohlin, Lydia E. Kavraki (2001) Presented by: Robbie Paolini.
Artificial Intelligence in Game Design Camera Control.
Whiteboard Warmup! A beam of electrons is being fired to the right, when a magnet is pointed toward the beam and brought closer. As a result, the beam.
Chapter 5.4 Artificial Intelligence: Pathfinding.
1 Constant Following Distance Simulations CS547 Final Project December 6, 1999 Jeremy Elson.
Applied Lab Physics Mrs. Campbell
© Manfred Huber Autonomous Robots Robot Path Planning.
Chapter 5 Natural Laws and Car Control
CSC321: Neural Networks Lecture 12: Clustering Geoffrey Hinton.
Vectors and Direction In drawing a vector as an arrow you must choose a scale. If you walk five meters east, your displacement can be represented by a.
Review of Two-Scale Particle Simulation Paper by: Barbara Solenthaler ETH Zurich Markus Gross ETH Zurich.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
Robotica Lecture 3. 2 Robot Control Robot control is the mean by which the sensing and action of a robot are coordinated The infinitely many possible.
Artificial Intelligence in Game Design Lecture 6: Fuzzy Logic and Fuzzy State Machines.
Speed Limits, Speed Control and Stopping Regulations.
Wandering Standpoint Algorithm. Wandering Standpoint Algorithm for local path planning Description: –Local path planning algorithm. Required: –Local distance.
Adrian Treuille, Seth Cooper, Zoran Popović 2006 Walter Kerrebijn
Artificial Intelligence in Game Design Complex Steering Behaviors and Combining Behaviors.
Value Function Approximation on Non-linear Manifolds for Robot Motor Control Masashi Sugiyama1)2) Hirotaka Hachiya1)2) Christopher Towell2) Sethu.
Forces cause changes in motion.. A ball at rest in the middle of a flat field is in equilibrium. No net force acts on it. If you saw it begin to move.
1 Motion Fuzzy Controller Structure(1/7) In this part, we start design the fuzzy logic controller aimed at producing the velocities of the robot right.
CSC321 Lecture 5 Applying backpropagation to shape recognition Geoffrey Hinton.
Autonomous Robots Robot Path Planning (3) © Manfred Huber 2008.
Artificial Intelligence in Game Design Lecture 8: Complex Steering Behaviors and Combining Behaviors.
CSC321: Introduction to Neural Networks and Machine Learning Lecture 15: Mixtures of Experts Geoffrey Hinton.
CSCI 4310 Lecture 5: Steering Behaviors in Raven.
Forces and Motion Physical Science, Physics in the Workplace Anne Rettig, Instructor.
Forces and motions I understand what causes and what stops motions on the planet Earth
Abstract LSPI (Least-Squares Policy Iteration) works well in value function approximation Gaussian kernel is a popular choice as a basis function but can.
Forces and Newton’s Laws Video Warm Up. What is a force? A force is a push or pull that causes an object to move, stop, or change direction. In physics,
Understanding AI of 2 Player Games. Motivation Not much experience in AI (first AI project) and no specific interests/passion that I wanted to explore.
Machine Learning Supervised Learning Classification and Regression
UNIT 5 CHALLENGES TO VEHICLE CONTROL
Q3.1 A bicyclist starts at point P and travels around a triangular path that takes her through points Q and R before returning to point P. What is the.
NATURAL LAWS & DRIVING It doesn’t matter what kind of vehicle you own or how skilled a driver you are, these forces affect your driving. Learning to understand.
CS 326A: Motion Planning Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe,
Schedule for next 2 weeks
Review and Ideas for future Projects
Chapter 4-3 The Foundations of Physical Science
Navigation In Dynamic Environment
Systems Design Nursebot
Memory Management (1).
Presentation transcript:

DAMN : A Distributed Architecture for Mobile Navigation Julio K. Rosenblatt Presented By: Chris Miles

Goal Behavior based systems Easy arbitration between all kinds of behaviors –Working towards different objectives –Different time scales Work towards simultaneous objectives

Motivation Behavior based systems are good It is difficult to arbitrate between the desired actions of different nodes however To overcome this an arbitration architecture should be imposed

Fixed Priorities – Certain nodes always have precedence over other nodes Vector Sum / Potential Fields – Average desired actions Other Arbitration Methods

Problems Lose information Nodes cannot specify their range of desired behavior, only their optimal solution Often times the 90% solution is enough Leads to two party system Does not find actions that satisfy multiple objectives simultaneously

Potential Field Problems Behaviors cannot easily specify the actions they want / do not want Undesired behavior –Do anything but drive into that rock –Point strongly away Non-specific behavior –just kinda go left –Cannot be done

Simultaneous Objectives In many cases in both robot and human life one is working towards a number of objectives simultaneously It is best to perform actions that help reach all or many of them at once, versus only focusing on a single objective at a time

DAMN Arbitration Behaviors vote across the range of possible behaviors Each possibility is given a value from -1 to 1 representing the nodes preference towards that action Each node has a weight, which determines how many votes it gets –allows for meta level control

Example – Collision Detection A obstacle avoidance behavior –Determines how long each action will take to lead to a collision If I turn left, how long until I hit the wall –Votes for each action based on that time –Since this behavior has a very strong weight, any actions leading to collision are strongly discouraged

The DAMN arbiters The actions voted on are discretized along appropriate dualities Turn –left, straight, right Speed –Fast, Slow, Stop, Reverse Field of Regard –Where to look / point cameras

Counting The Votes Vote in discrete space Combine them into continuous space – Similar to defuzzification Add up those votes Smooth the resultant Fit a parabola to the optimal + neighboring values Take the peak of the parabola as the action

Why a Parabola? Keeps the solution from being smoothed into no-zones

DAMN Behaviors They mention a number of behaviors, how they vote and why they are important

Collision Detection Similar to my example, only vote lower for paths that lead to near collisions as well

Vehicle Dynamics Vote against behaviors that exceed the vehicles capabilities –Vital for any robot that moves more then 2 mph Aimed at keeping the robot from rolling over as it turns Note: curvature is proportional to center of gravity –An SUV twice as high as a car can take half the turn

Goal Directed Behaviors Paper describes a number of high level behaviors DAMN does not restrict behaviors from operating at different voting frequencies – Slower behaviors vote less often Not sure what happens between those votes Planners vote for actions that move too satisfy their objectives

Weights Determine how strongly this behaviors opinion counts Low level behaviors have higher weights –Obstacle avoidance takes precedence over path following Behaviors can vote for flat areas where any behavior is good The less weighted behaviors vote is then the deciding factor

Example Planner says turn either 25 degrees right, 15 degrees left, or 170 degrees right Obstacle Avoidance says don’t turn left there is a wall Vehicle dynamics behavior says don’t turn more then 30 in either direction based on current speed The other behaviors rule out the two unsafe behaviors associated with the planner No interference in the planners final preference

Conclusions DAMN uses voting to arbitrate between behaviors Very natural behaviors Combine for powerful results

Other Arbitration Schemes In DAMN Other arbitration schemes can be implemented in DAMN Nodes voting entirely for a single field = Priority based If nodes vote in triangular fashion – Potential fields

Pros Behaviors are insanely obvious Natural and powerful idea Beats the electoral system General Objective Designed Distributed Architecture for Mobile Navigation systems are even more powerful

Cons Have to vote across the array of all possible actions Many degrees of freedoms -> many continuums to vote over Difficulties in dealing with interwoven continuums – speed / turn reactions –Vehicle Dynamics behavior seems to deal with that very well