Tokyo Institute of Technology Tokyo Institute of Technology

Similar documents
2. Independence and Bernoulli Trials

Functions of Random Variables

Point Estimation: definition of estimators

Channel Models with Memory. Channel Models with Memory. Channel Models with Memory. Channel Models with Memory

PTAS for Bin-Packing

1 Lyapunov Stability Theory

ECE 421/599 Electric Energy Systems 7 Optimal Dispatch of Generation. Instructor: Kai Sun Fall 2014

Rock-Paper-Scissors: An Example of a Multi-agent Dynamical System

Block-Based Compact Thermal Modeling of Semiconductor Integrated Circuits

ENGI 3423 Simple Linear Regression Page 12-01

Laboratory I.10 It All Adds Up

IS 709/809: Computational Methods in IS Research. Simple Markovian Queueing Model

7.0 Equality Contraints: Lagrange Multipliers

Estimation of Stress- Strength Reliability model using finite mixture of exponential distributions

Lecture 9. Some Useful Discrete Distributions. Some Useful Discrete Distributions. The observations generated by different experiments have

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

Sequential Approach to Covariance Correction for P-Field Simulation

CSE 5526: Introduction to Neural Networks Linear Regression

Computations with large numbers

Special Instructions / Useful Data

Likewise, properties of the optimal policy for equipment replacement & maintenance problems can be used to reduce the computation.

Econometric Methods. Review of Estimation

KLT Tracker. Alignment. 1. Detect Harris corners in the first frame. 2. For each Harris corner compute motion between consecutive frames

Lecture Notes Types of economic variables

Multi Objective Fuzzy Inventory Model with. Demand Dependent Unit Cost and Lead Time. Constraints A Karush Kuhn Tucker Conditions.

9.1 Introduction to the probit and logit models

2SLS Estimates ECON In this case, begin with the assumption that E[ i

The Selection Problem - Variable Size Decrease/Conquer (Practice with algorithm analysis)

CHAPTER VI Statistical Analysis of Experimental Data

A tighter lower bound on the circuit size of the hardest Boolean functions

Ordinary Least Squares Regression. Simple Regression. Algebra and Assumptions.

Comparison of Dual to Ratio-Cum-Product Estimators of Population Mean

Entropy ISSN by MDPI

Feature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture)

4. Standard Regression Model and Spatial Dependence Tests

Convergence of the Desroziers scheme and its relation to the lag innovation diagnostic

Two Fuzzy Probability Measures

Random Variate Generation ENM 307 SIMULATION. Anadolu Üniversitesi, Endüstri Mühendisliği Bölümü. Yrd. Doç. Dr. Gürkan ÖZTÜRK.

Random Variables. ECE 313 Probability with Engineering Applications Lecture 8 Professor Ravi K. Iyer University of Illinois

Parameter Estimation

Simple Linear Regression

THE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA

Entropy, Relative Entropy and Mutual Information

ECON 5360 Class Notes GMM

ENGI 4421 Joint Probability Distributions Page Joint Probability Distributions [Navidi sections 2.5 and 2.6; Devore sections

THE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA

Multiple Choice Test. Chapter Adequacy of Models for Regression

CS 2750 Machine Learning Lecture 5. Density estimation. Density estimation

Chapter 4 (Part 1): Non-Parametric Classification (Sections ) Pattern Classification 4.3) Announcements

Outline. Point Pattern Analysis Part I. Revisit IRP/CSR

arxiv: v1 [cs.lg] 22 Feb 2015

STA 108 Applied Linear Models: Regression Analysis Spring Solution for Homework #1

Chapter 5 Properties of a Random Sample

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

G S Power Flow Solution

Unit 9. The Tangent Bundle

Performance of Energy Efficient Relaying for Cluster-Based Wireless Sensor Networks

9 U-STATISTICS. Eh =(m!) 1 Eh(X (1),..., X (m ) ) i.i.d

Source-Channel Prediction in Error Resilient Video Coding

Manipulator Dynamics. Amirkabir University of Technology Computer Engineering & Information Technology Department

Chapter 13, Part A Analysis of Variance and Experimental Design. Introduction to Analysis of Variance. Introduction to Analysis of Variance

PPCP: The Proofs. 1 Notations and Assumptions. Maxim Likhachev Computer and Information Science University of Pennsylvania Philadelphia, PA 19104

Lecture Note to Rice Chapter 8

Consensus Control for a Class of High Order System via Sliding Mode Control

ENGI 4421 Propagation of Error Page 8-01

Simulation Output Analysis

ECE 595, Section 10 Numerical Simulations Lecture 19: FEM for Electronic Transport. Prof. Peter Bermel February 22, 2013

Research on Efficient Turbo Frequency Domain Equalization in STBC-MIMO System

For combinatorial problems we might need to generate all permutations, combinations, or subsets of a set.

UNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS

Analysis of a Repairable (n-1)-out-of-n: G System with Failure and Repair Times Arbitrarily Distributed

THE ROYAL STATISTICAL SOCIETY 2016 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE MODULE 5

Homework #2 Solutions, EE/MSE 486, Spring 2017 Problem 1:

A class of Liu-type estimators based on ridge regression under multicollinearity with an application to mixture experiments

Summary of the lecture in Biostatistics

ANALYSIS ON THE NATURE OF THE BASIC EQUATIONS IN SYNERGETIC INTER-REPRESENTATION NETWORK

2.160 System Identification, Estimation, and Learning Lecture Notes No. 17 April 24, 2006

Median as a Weighted Arithmetic Mean of All Sample Observations

Chapter 9 Jordan Block Matrices

Singular Value Decomposition. Linear Algebra (3) Singular Value Decomposition. SVD and Eigenvectors. Solving LEs with SVD

Derivation of 3-Point Block Method Formula for Solving First Order Stiff Ordinary Differential Equations

Lecture 7. Confidence Intervals and Hypothesis Tests in the Simple CLR Model

Regression and the LMS Algorithm

ρ < 1 be five real numbers. The

Lecture 07: Poles and Zeros

Mechanics of Materials CIVL 3322 / MECH 3322

ε. Therefore, the estimate

Bayesian Classification. CS690L Data Mining: Classification(2) Bayesian Theorem: Basics. Bayesian Theorem. Training dataset. Naïve Bayes Classifier

LINEAR REGRESSION ANALYSIS

Nonparametric Density Estimation Intro

Factorization of Finite Abelian Groups

Lecture 2 - What are component and system reliability and how it can be improved?

Chapter 3 Sampling For Proportions and Percentages

Chapter 4: Linear Momentum and Collisions

A Robust Total Least Mean Square Algorithm For Nonlinear Adaptive Filter

Training Sample Model: Given n observations, [[( Yi, x i the sample model can be expressed as (1) where, zero and variance σ

STK4011 and STK9011 Autumn 2016

Midterm Exam 1, section 2 (Solution) Thursday, February hour, 15 minutes

Solving Constrained Flow-Shop Scheduling. Problems with Three Machines

C-1: Aerodynamics of Airfoils 1 C-2: Aerodynamics of Airfoils 2 C-3: Panel Methods C-4: Thin Airfoil Theory

Transcription:

Outle ult-aget Search usg oroo Partto ad oroo D eermet Revew Itroducto Decreasg desty fucto Stablty Cocluso Fujta Lab, Det. of Cotrol ad System Egeerg, FL07--: July 09,007 Davd Ask ork rogress:. Smulato of oroo D wth desty fucto. Lloyd s Algorthm D eermet Future ork Revew Revew Revew meu:. oroo artto D & D. Lloyd s Algorthm. Objectve fucto: - Sesg erformace - Desty fucto oroo artto: The set of all ots q whose dstace from s less tha or equal to the dstaces from all other j { : } = q j q q j 0 Revew Revew Lloyd s Algorthm: A method for evely dstrbutg ots over a ukow area. The stes: Ste 0: Start wth a radom area, {}, ad radom ots, {}. Ste : Costruct oroo artto {}, geerated by {}. Ste : Udate to be the cetrod of. Retur to Ste. Ste 0: Start wth a radom area, {}, ad radom ots, {}. Ste : Costruct oroo artto {}, geerated by {}. Ste : Udate to be the cetrod of. Retur to Ste. 0

Revew Revew Objectve fucto: f ( q ): (, ) = ( ) φ H f q q Sesg erformace (f=bg oor sesg) Desty fucto φ ( q): = aget osto q = object = artto By mmzg H, we get otmum coverage. hy? he H = m, agets move to the area wth the hghest occurrece ossblty. e assume: f q = q Smlfy the objectve fucto usg arallel as theorem. H, = f q φ q To mmze ths, =C w (=cetrod of artto) Therefore, use ths as a ut to make agets go to cetrod of the artto. (, ) (, ) = φ : H = H c c q mass Alcato: Itroducto Autoomous N agets equed wth sesors deloy themselves a otmal way over a ukow area. search & rescue, evrometal motorg, mltary ad defece alcato, etc. Objectve: mult-aget search Agets deloy themselves otmally whle udatg (=reducg) ucertaty desty fucto ad gather formato tll the ucertaty s below a certa level. Decreasg Desty Fucto At each terato, after deloyg themselves otmally, the sesors gather formato about, reducg the desty fucto as: β ( q) ( q) m{ ( q )} φ = φ β φ ( q ) [ ] : desty fucto : sesg erformace : osto of the -th sesor β : a 0, s the factor of reducto hy m{ β ( q )}? Oly the aget wth the smallest β ca reduce the ucertaty by the largest amout. Decreasg Desty Fucto For sesg erformace fucto: ( ) β s mmum. As aroaches q β decreases (=good sesg) As go further away from q β creases (=bad sesg) Cocluso: he = q, β q = ke α k α > 0 ( 0,) Decreasg Desty Fucto For objectve fucto: H ( q) = ma{ φ φ } { φ ( q) φ ( q) m{ β( q )}} φ( q) { m{ β( q )}} = φ { β( )} = φ q { } = φ q ke = φ q ke q q

Decreasg Desty Fucto Objectve fucto: = φ H φ ( α)( ) = q ke ( α) ( φ q q) ( α) φ( q) φ ( α) φ( q) φ H q ke { q q } ( α ){ C} = C q q φ ( q) = φ φ = q C = qφ ( q) q ke α Decreasg Desty Fucto H = From C, we ca coclude that the ecessary codto for otmalty s, ( ad are resectvely the mass ad the cetrod of wth resect to ) Assume the system as & = u. Use the result above as a ut: u k = ro C k ro > 0 C = C φ C Ths moves the aget towards. DDF Summary Objectve: Agets deloy themselves otmally whle reducg ucertaty desty fucto ad gather formato tll the ucertaty s below a certa level. Decreasg desty fucto: q φ ( q) = φ( q) m{ β( q )} β ( q ) ke α = Objectve fucto: H ( q ) q ( q ) ke = φ = φ H = C O system &, use ths as a ut: u k = u = ro C Stablty Cosder the X H, where X =,, K, N reresets the cofguratos of N agets. dh dt = & X = δ H = & δ = α C & = α C k ro C =kro C Sce α > 0, k ro > 0, & s a egatve defte. Stablty Cocluso By LaSalle s varace rcle, the trajectores of the agets govered by cotrol law: startg from ay tal cofgurato, wll asymtotcally coverge to cetrodal oroo artto wth resect to the desty fucto: Note: C u k = ro C φ ( q) = φ C = qφ q q ke α = φ q Objectve: Agets deloy themselves otmally, gather formato ther resectve oroo artto ad hece reduce ucertaty desty fucto. (Note: the teratos are cotued tll the ucertaty the s below a requred level) The oe-ste otmal deloymet s the cetrodal oroo cofgurato wth resect to the reduced desty fucto. Prove stable by LaSalle s varace rcle.

ork Progress (-0-a) ork Progress (-0-b) Smulato of oroo D wth costat desty fucto φ = : ( = 9 agets) Last osto: ork Progress (-0-c) ork Progress (--a) Trajectory grah: Smulato of oroo D wth desty fucto φ = e y : ( = 9 agets) ork Progress (--b) ork Progress (--c) Last osto: Trajectory grah: 4

ork Progress (--a) Smulato of oroo D wth desty fucto φ = e y : ( = 9 agets) Last osto: ork Progress (--b) ork Progress (--c) ork Progress () Trajectory grah: Lloyd s Algorthm D smulato wth desty fucto φ = : Objectve of the eermet: To test the covergece characterstc of Lloyd s Algorthm D usg RC cars. Equmet: ork Progress () Software: ork Progress (). Halco: Orders the camera to cature the osto of the cars.. Smulk: Processes the data catured by Halco. (Lloyd s Algorthm block s wrtte here) 5

Software: ork Progress (). Cotrol Desk:. Receves order (outut) from Smulk ad asses t to RC motors.. otors cars osto, seed, voltage gve, etc. Software dagram: ork Progress () 4. crosoft sual C: Lks data betwee Halco ad Smulk. ork Progress () ork Progress () Eermet order:. ake crcles out of cardboard (as cars osto) for camera to read, ad reare the feld.. ake Halco rogram.. ake C rogram to lk data from Halco to Smulk. 4. ake Lloyd s Algorthm block dagram Smulk. 5. Lk Smulk wth Cotrol Desk ad make motors Cotrol Desk. Lloyd s Algorthm D block dagram: Halco oroo C - otor Halco oroo C - otor u u Adjust voltage, cars seed, drecto, camera, etc. Debug ad comle. Halco oroo C - otor u ork Progress () Future ork Trouble: Dfferet tme/day, dfferet car ad camera characterstc. Adjustmet for car seed, drecto. Lmted ower o cars battery reflects o erformace. Frcto betwee the feld ad the tre. Camera s vso s wared (afflcts o vdeo caturg erformace). Backward movemet. Etc. Lloyd s Algorthm D eermet revso. Lloyd s Algorthm D eermet wth desty fucto. ult-aget Search D smulato. Read more coverage cotrol aers, etc. Backward movemet: Forward : Sto :.8 Backward :.6.6.8.6 If ossble, Lloyd s Algorthm D eermet wth costat desty fucto. 6

Refereces Gururasad K.R., Debassh Ghose, ult-aget Search usg oroo Parttos, ACODS, 007 Jorge Cortes, Soa artez, Tmur Karatas, Fracesco Bullo, Coverage Cotrol for oble Sesg Networks, IEEE, 007 Bruce Fracs, Dstrbuted Cotrol of Autoomous oble Robots, 006 7