Multiobjective control: safety and efficiency Hamsa Balakrishnan, David Culler, Edward A. Lee, S. Shankar Sastry, Claire Tomlin (PI) University of California.

Slides:



Advertisements
Similar presentations
Sequence comparison: Dynamic programming Genome 559: Introduction to Statistical and Computational Genomics Prof. James H. Thomas.
Advertisements

1 LP Duality Lecture 13: Feb Min-Max Theorems In bipartite graph, Maximum matching = Minimum Vertex Cover In every graph, Maximum Flow = Minimum.
Stochastic Distributed Protocol for Electric Vehicle Charging with Discrete Charging Rate Lingwen Gan, Ufuk Topcu, Steven Low California Institute of Technology.
Tutorial at ICCV (Barcelona, Spain, November 2011)
Greedy Algorithms Be greedy! always make the choice that looks best at the moment. Local optimization. Not always yielding a globally optimal solution.
Hybrid Systems Controller Synthesis Examples EE291E Tomlin.
Separating Hyperplanes
Decomposable Optimisation Methods LCA Reading Group, 12/04/2011 Dan-Cristian Tomozei.
The Out of Kilter Algorithm in Introduction The out of kilter algorithm is an example of a primal-dual algorithm. It works on both the primal.
THE SINGLE MACHINE EARLY/TARDY PROBLEM* PENG SI OW & THOMAS E. MORTON IE Paper Presentation A. İrfan Mahmutoğulları *Ow, P. S., & Morton, T. E. (1989).
Intelligent Vehicle-Highway Systems
An “optimal” controller in Soft Walls is one which always pushes away from the no-fly zone. To blend the control in gradually, we would like to increase.
Robust Hybrid and Embedded Systems Design Jerry Ding, Jeremy Gillula, Haomiao Huang, Michael Vitus, and Claire Tomlin MURI Review Meeting Frameworks and.
ActionWebs Hamsa Balakrishnan, David Culler, Edward A. Lee, S. Shankar Sastry, Claire Tomlin (PI) University of California at Berkeley July
Deadlock-Free and Collision- Free Coordination of Two Robot Manipulators Patrick A. O’Donnell and Tomás Lozano- Pérez by Guha Jayachandran Guha Jayachandran.
An Introduction to the Soft Walls Project Adam Cataldo Prof. Edward Lee University of Pennsylvania Dec 18, 2003 Philadelphia, PA.
Control Strategies for Restricting the Navigable Airspace of Commercial Aircraft Adam Cataldo and Edward Lee NASA JUP Meeting 28 March 2003 Stanford, CA.
Fusing Machine Learning & Control Theory With Applications to Smart Buildings & ActionWebs UC Berkeley ActionWebs Meeting November 03, 2010 By Jeremy Gillula.
Integrated Design and Analysis Tools for Software-Based Control Systems Shankar Sastry (PI) Tom Henzinger Edward Lee University of California, Berkeley.
1 Introduction to Linear and Integer Programming Lecture 9: Feb 14.
Linear Regression  Using a linear function to interpolate the training set  The most popular criterion: Least squares approach  Given the training set:
Approximation Algorithms
EMGT 501 HW # (b) (c) 6.1-4, Due Day: Sep. 21.
Softwalls: Preventing Aircraft from Entering Unauthorized Airspace Adam Cataldo Prof. Edward Lee Ian Mitchell Prof. Shankar Sastry CHESS Review May 8,
February 11, 2010 Center for Hybrid and Embedded Software Systems Cyber-Physical Systems (CPS): Orchestrating networked.
Hybrid Systems: Model Identification and State Estimation Hamsa Balakrishnan, David Culler, Edward A. Lee, S. Shankar Sastry, Claire Tomlin (PI) University.
Decentralized Optimization, with application to Multiple Aircraft Coordination Decision Making Under Uncertainty MURI Review, July 2002 Gökhan Inalhan,
June 20, 2001MURI Review Meeting Decision-Making under Uncertainty University of California, Berkeley Venkat Anantharam Laurent El Ghaoui Michael I. Jordan.
EE291E - UC BERKELEY EE291E: Hybrid Systems T. John Koo and S. Shankar Sastry Department of EECS University of California at Berkeley Spring 2002
1 Collision Avoidance Systems: Computing Controllers which Prevent Collisions By Adam Cataldo Advisor: Edward Lee Committee: Shankar Sastry, Pravin Varaiya,
Softwalls: Preventing Aircraft from Entering Unauthorized Airspace Adam Cataldo Prof. Edward Lee Prof. Ian Mitchell, UBC Prof. Shankar Sastry NASA JUP.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Identity Management in Sensor Networks Hamsa Balakrishnan Stanford University.
Soft Walls, Cataldo 1 Restricting the Control of Hijackers: Soft Walls Presented By Adam Cataldo UC Berkeley NASA Ames Research Center 22 November 2002.
ActionWebs Hamsa Balakrishnan, David Culler, Edward A. Lee, S. Shankar Sastry, Claire Tomlin (PI) University of California at Berkeley December
Data Envelopment Analysis. Weights Optimization Primal – Dual Relations.
Project Presentation by Eddie Smolyansky & Shilo Abramovitch Supervisor: David Erdos.
Maryam Kamgarpour, Claire Tomlin, David Culler, Shankar Sastry, Edward Lee, Hamsa Balakrishnan University of California at Berkeley August Outreach.
Professor: Chu, Ta Chung Student: Nguyen Quang Tung Student’s ID: M977Z235 Fuzzy multiobjective linear model for supplier selection in a supply chain.
Algorithms for MAP estimation in Markov Random Fields Vladimir Kolmogorov University College London.
1 Lagrangean Relaxation --- Bounding through penalty adjustment.
Finding Optimal Solutions to Cooperative Pathfinding Problems Trevor Standley and Rich Korf Computer Science Department University of California, Los Angeles.
Reachability-based Controller Design for Switched Nonlinear Systems EE 291E / ME 290Q Jerry Ding 4/18/2012.
Inexact SQP methods for equality constrained optimization Frank Edward Curtis Department of IE/MS, Northwestern University with Richard Byrd and Jorge.
Decision Making Under Uncertainty PI Meeting - June 20, 2001 Distributed Control of Multiple Vehicle Systems Claire Tomlin and Gokhan Inalhan with Inseok.
Hybrid Systems Controller Synthesis Examples EE291E Tomlin/Sastry.
1 S ystems Analysis Laboratory Helsinki University of Technology Manuscript “On the Use of Influence Diagrams in a One-on-One Air Combat Game” in Kai Virtanen’s.
Multi-Objective Optimization for Topology Control in Hybrid FSO/RF Networks Jaime Llorca December 8, 2004.
Water resources planning and management by use of generalized Benders decomposition method to solve large-scale MINLP problems By Prof. André A. Keller.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Achieving Goals in Decentralized POMDPs Christopher Amato Shlomo Zilberstein UMass.
Date of download: 7/8/2016 Copyright © ASME. All rights reserved. From: Computation of Lower Bounds for a Multiple Depot, Multiple Vehicle Routing Problem.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project A Distributed Newton Method for Network Optimization Ali Jadbabaie and Asu Ozdaglar.
Chapter 1 Introduction Copyright © 2007 Pearson Addison-Wesley. All rights reserved.
The minimum cost flow problem
Dynamic Programming Copyright © 2007 Pearson Addison-Wesley. All rights reserved.
Sequence comparison: Dynamic programming
Unit-4: Dynamic Programming
Approximation Algorithms
Compute convex lower bounding function and optimize it instead!
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Chapter 1 Introduction Copyright © 2007 Pearson Addison-Wesley. All rights reserved.
Linear Constrained Optimization
Presentation transcript:

Multiobjective control: safety and efficiency Hamsa Balakrishnan, David Culler, Edward A. Lee, S. Shankar Sastry, Claire Tomlin (PI) University of California at Berkeley December

Multiobjective control Target Set Maneuver sequencing is accomplished by stringing together capture sets, starting from the target set and working backwards Avoid sets can be combined with capture sets to guarantee safety Unsafe Set

Example: Collision Avoidance Pilots instructed to attempt to collide vehicles [Gabe Hoffmann]

Back-Flip: Results

Decentralized optimization based on dual decomposition Consider the following simple example: aircraft, each with dynamics Private (local) cost function: Global cost function:

Centralized Optimization

Dual Decomposition: Overview One primal problem leads to many dual problems The dual decomposition method –solves one instance of these many dual problems –breaks the primal problem into a set of small problems –provides a lower bound on the global optimal solution If the problem is convex, dual decomposition returns the global optimal solution

Primal Problem Dual Problem Decoupled Primal Problem Dual Decomposition: Overview ’ 2’ 2’’ 3’ 1 3 1’ 2’ 2’’ 3’ 2

Decentralized results after 5 iterations