Morse Theory and Formation Control formulas for computing bias in localization problem Brian D O Anderson.

Slides:



Advertisements
Similar presentations
Reactive and Potential Field Planners
Advertisements

5.1 Real Vector Spaces.
Boyce/DiPrima 9th ed, Ch 2.8: The Existence and Uniqueness Theorem Elementary Differential Equations and Boundary Value Problems, 9th edition, by William.
Computational Topology for Computer Graphics Klein bottle.
By Groysman Maxim. Let S be a set of sites in the plane. Each point in the plane is influenced by each point of S. We would like to decompose the plane.
Physics 430: Lecture 16 Lagrange’s Equations with Constraints
Ch 9.1: The Phase Plane: Linear Systems
Some Ideas Behind Finite Element Analysis
Function Optimization Newton’s Method. Conjugate Gradients
1 Last lecture  Path planning for a moving Visibility graph Cell decomposition Potential field  Geometric preliminaries Implementing geometric primitives.
Copyright © Cengage Learning. All rights reserved.
INTEGRALS Areas and Distances INTEGRALS In this section, we will learn that: We get the same special type of limit in trying to find the area under.
APPLICATIONS OF DIFFERENTIATION
17 VECTOR CALCULUS.
15 PARTIAL DERIVATIVES.
Constrained Optimization
INFINITE SEQUENCES AND SERIES
16 MULTIPLE INTEGRALS.
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2003/index.htm Configuration Space – Basic Path-Planning Methods.
Volume and Angle Structures on closed 3-manifolds Feng Luo Rutgers University Oct. 28, 2006 Texas Geometry/Topology conference Rice University.
Copyright © Cengage Learning. All rights reserved. 5 Integrals.
Definition and Properties of the Production Function Lecture II.
Neural Networks Lecture 8: Two simple learning algorithms
Angles Type of angle: Acute: An Angle less than 90 degrees Right angle: An angle that is 90 degrees Obtuse angle: An angle more than 90 degrees Straight.
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
Morphological Analysis of 3D Scalar Fields based on Morse Theory and Discrete Distortion Mohammed Mostefa Mesmoudi Leila De Floriani Paola Magillo Dept.
1 Preliminaries Precalculus Review I Precalculus Review II
Chapter 7: The Normal Probability Distribution
Ch. 10 Vector Integral Calculus.
Linear Algebra Chapter 4 Vector Spaces.
UNIVERSAL FUNCTIONS A Construction Using Fourier Approximations.
The importance of sequences and infinite series in calculus stems from Newton’s idea of representing functions as sums of infinite series.  For instance,
1 Part II: Linear Algebra Chapter 8 Systems of Linear Algebraic Equations; Gauss Elimination 8.1 Introduction There are many applications in science and.
Chapter 3 Application of Derivatives 3.1 Extreme Values of Functions Absolute maxima or minima are also referred to as global maxima or minima.
INTEGRALS Areas and Distances INTEGRALS In this section, we will learn that: We get the same special type of limit in trying to find the area under.
Vectors and the Geometry of Space 9. Vectors 9.2.
Copyright © Cengage Learning. All rights reserved. 12 Vectors and the Geometry of Space.
MA4248 Weeks 1-3. Topics Coordinate Systems, Kinematics, Newton’s Laws, Inertial Mass, Force, Momentum, Energy, Harmonic Oscillations (Springs and Pendulums)
Math 3120 Differential Equations with Boundary Value Problems
16 VECTOR CALCULUS.
INTEGRALS 5. INTEGRALS In Chapter 2, we used the tangent and velocity problems to introduce the derivative—the central idea in differential calculus.
Integrals  In Chapter 2, we used the tangent and velocity problems to introduce the derivative—the central idea in differential calculus.  In much the.
Copyright © Cengage Learning. All rights reserved. 4 Integrals.
Boyce/DiPrima 9 th ed, Ch 10.8: Laplace’s Equation Elementary Differential Equations and Boundary Value Problems, 9 th edition, by William E. Boyce and.
CS201: Data Structures and Discrete Mathematics I
MATH 224 – Discrete Mathematics
Chapter 7 Energy of a System.
Differential Equations Chapter 1. A differential equation in x and y is an equation that involves x, y, and derivatives of y. A mathematical model often.
Applications of Differentiation Section 4.9 Antiderivatives
In Chapters 6 and 8, we will see how to use the integral to solve problems concerning:  Volumes  Lengths of curves  Population predictions  Cardiac.
Introduction to Optimization
5 INTEGRALS.
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 7 Functions Instructor: Hayk Melikyan Today we will review sections 7.3, 7.4 and 7.5.
Copyright © Cengage Learning. All rights reserved. 16 Vector Calculus.
Basic Theory (for curve 01). 1.1 Points and Vectors  Real life methods for constructing curves and surfaces often start with points and vectors, which.
Information and Control Architectures for Formation Maintenance Swarming in Natural and Engineered Systems Workshop Brian DO Anderson (work involves others)
1 Objective To provide background material in support of topics in Digital Image Processing that are based on matrices and/or vectors. Review Matrices.
Ch 9.6: Liapunov’s Second Method In Section 9.3 we showed how the stability of a critical point of an almost linear system can usually be determined from.
Area/Sigma Notation Objective: To define area for plane regions with curvilinear boundaries. To use Sigma Notation to find areas.
Copyright © Cengage Learning. All rights reserved. 4 Integrals.
Boyce/DiPrima 10th ed, Ch 10.8: Laplace’s Equation Elementary Differential Equations and Boundary Value Problems, 10th edition, by William E. Boyce and.
Boyce/DiPrima 9th ed, Ch 9.6: Liapunov’s Second Method Elementary Differential Equations and Boundary Value Problems, 9th edition, by William E. Boyce.
§7-4 Lyapunov Direct Method
Chap 3. The simplex method
3D Transformation CS380: Computer Graphics Sung-Eui Yoon (윤성의)
Stability Analysis of Linear Systems
Derivatives in Action Chapter 7.
Chapter 5: Morse functions and function-induced persistence
Presentation transcript:

Morse Theory and Formation Control formulas for computing bias in localization problem Brian D O Anderson

What is Morse Theory and our Motivation? Simple Example of Morse Theory Koditschek’s Navigation Function Problem Euler Characteristic Koditschek’s problem and Euler Characteristic Formation Shape Control Conclusions 2 Outline 13 May 2011 Morse Theory and Formation Control

Morse theory is a set of results regarding the number of minima, maxima and saddle points of a scalar real function of a number of real variables By extension, it will often give information about the number of stable, unstable and saddle point equilibria for an autonomous system or closed-loop control system Researchers, including ourselves, have found that many formation shape control laws can have multiple equilibria. It is of great interest then to know what restrictions this will impose on use of the system. You don’t want to end up at the wrong equilibrium point Hence we study Morse Theory. 3 What is Morse Theory and our Motivation? 13 May 2011 Morse Theory and Formation Control

What is Morse Theory and our Motivation? Simple Example of Morse Theory Koditschek’s Navigation Function Problem Euler Characteristic Koditschek’s problem and Euler Characteristic Formation Shape Control Conclusions 4 Outline 13 May 2011 Morse Theory and Formation Control

Very simple motivating example Consider a function f: R 1  R 1 What can we say about the number of minima and maxima? Impose restrictions: –Function is smooth –At every point where f’(x 0 ) = 0, the second derivative f’’(x 0 ) ≠0 –f goes to +∞ when x goes to ±∞. –Extreme points are isolated. 13 May There are 4 minima and 3 maxima (discounting x =±∞.)

General Rule Consider a smooth function f: R 1  R 1 such that –At every point where f’(x 0 ) = 0, the second derivative f’’(x 0 ) ≠0 –f goes to +∞ when x goes to ±∞. –Extreme points are isolated. Let m 0, m 1 denote the number of minima and maxima. Then 13 May Morse Theory and Formation Control m 0 ≥ 1 (Morse inequality) m 0 —m 1 = 1 (Morse equality) There are 4 minima and 3 maxima (discounting x =±∞.) If f: (a,b)  R 1 and f’(a) 0, same result holds.

General Rule Consider a smooth function f: R 1  R 1 such that –At every point where f’(x 0 ) = 0, the second derivative f’’(x 0 ) ≠0 –f goes to +∞ when x goes to ±∞. –Extreme points are isolated. Let m 0, m 1 denote the number of minima and maxima. Then What happens if f: R 2  R 1 or f: R n  R 1 where n > 2? –Morse theory provides the answer, and numbers of saddle points (as well as minima, maxima) enter the inequality/equality set. 13 May Morse Theory and Formation Control m 0 ≥ 1 (Morse inequality) m 0 —m 1 = 1 (Morse equality)

Another Example In R 2 the unit circle is known as S 1. In R 3, the unit sphere is known as S 2. In R n, the sphere (defined by x 1 2 +x 2 2 +…x n 2 =1) is known as S n-1. Consider a function f: S 1  R 1. How many minima and maxima does it have? Assume: –f is smooth –At any point where first derivative is zero, second derivative is nonzero –Extreme points are isolated. Then there holds 13 May Morse Theory and Formation Control m 0 ≥ 1 (Morse inequality) m 0 —m 1 = 0 (Morse equality) But what if f: S n  R 1 where n > 1?

Comparing R 1, S 1 For functions on R 1 : For functions on S 1 : 13 May Morse Theory and Formation Control m 0 ≥ 1 (Morse inequality) m 0 —m 1 = 1 (Morse equality) m 0 ≥ 1 (Morse inequality) m 0 —m 1 = 0 (Morse equality)

Looking ahead Associated with a space are a number of nonnegative integers –Betti numbers β i –Euler characteristic χ (related to Betti) Consider a function f defined on some space and taking real values. –Suppose at critical points of f, i.e. points x 0 where f’(x 0 )=0, the second derivative Hessian f”(x 0 ) is nonsingular. – Let j be the number of negative eigenvalues of f”(x 0 ). Let m j be the number of critical points with index j. Then the set of m j can be related to the set of β i by a collection of inequalities and one equality. –The equality can also be expressed with the Euler characteristic. 13 May Morse Theory and Formation Control Characteristics of the space determine inequalities and equalities for the number of critical points of different degrees of any function defined on the space.

Comparing R 1, S 1 For functions on R 1 : For functions on S 1 : 13 May Morse Theory and Formation Control m 0 ≥ 1 (Morse inequality) m 0 —m 1 = 1 (Morse equality) m 0 ≥ 1 (Morse inequality) m 0 —m 1 = 0 (Morse equality) Right side determined by Betti numbers of R 1 or S 1 = Euler characteristic of R 1 or S 1 Euler characteristic can be found from Betti numbers but is independent concept

What is Morse Theory and our Motivation? Simple Example of Morse Theory Koditschek’s Navigation Function Problem Euler Characteristic Koditschek’s problem and Euler Characteristic Formation Shape Control Conclusions 12 Outline 13 May 2011 Morse Theory and Formation Control

A control problem (Koditschek 1989) This work involves the notion of a potential function, and a steepest descent control law. Consider a particle moving in R n under the influence of a potential field. There is an underlying scalar potential function V(x) and the particle moves according to Where does the particle end up? –At an equilbrium point, i.e. where V(x) has zero derivative or f(x) has a zero. The navigation problem: given a region where a robot moves, specify a V(x) guaranteeing convergence to a prescribed x May Morse Theory and Formation Control Equilibrium points of differential equation are same as critical points of V(x)

Some relevant questions What is the region in which a robot moves? –Is it R 2, R 3 or something more complicated? –Is it R 2, R 3 perhaps with obstacles? If the robot is to go to x 0 always, –Do we not want any other equilibria? –Or do we not want any other stable equilibria? There have been lots or examples in the robot literature showing that when you introduce obstacles, the robot can hang up at an incorrect point. Can Morse theory, distinguishing as it does the stability/instability of equilibria, help answer the above questions? 13 May Morse Theory and Formation Control

Simple answer for R 2 Suppose the robot is moving in R 2 and there are no obstacles. Then one could choose Notice that V is smooth, has a unique isolated minimum, its Hessian is nonzero at the minimum and it goes to infinity when x goes to ±∞. The trajectory will then be a steepest descent from initial state to x 0 and convergence is exponentially fast: 13 May Morse Theory and Formation Control Same idea also works for R 3

Sphere worlds A sphere world is a compact connected subset of R n whose boundary is formed from the disjoint union of a finite number, say M+1 of (n-1)-spheres One large sphere bounds the workspace: 13 May Morse Theory and Formation Control

Sphere worlds A sphere world is a compact connected subset of R n whose boundary is formed from the disjoint union of a finite number, say M+1 of (n-1)-spheres One large sphere bounds the workspace: M smaller spheres bound the obstacles within the workspace: 13 May Morse Theory and Formation Control

Sphere worlds A sphere world is a compact connected subset of R n whose boundary is formed from the disjoint union of a finite number, say M+1 of (n-1)-spheres One large sphere bounds the workspace: M smaller spheres bound the obstacles within the workspace: The robot operates in the free space To ensure nonintersecting obstacles with closures in interior of workspace: 13 May Morse Theory and Formation Control

More on Sphere World Sphere World can be distorted so that obstacles are not circular and results are still valid Koditschek works with sphere world Answer to the navigation problem is provided using Euler Characteristic –Now look at Euler characteristic –Then return to sphere world navigation problem 13 May Morse Theory and Formation Control

What is Morse Theory and our Motivation? Simple Example of Morse Theory Koditschek’s Navigation Function Problem Euler Characteristic Koditschek’s problem and Euler Characteristic Formation Shape Control Conclusions 20 Outline 13 May 2011 Morse Theory and Formation Control

Euler Characteristic—oversimplified view Consider a cube. It is said to have a cellular decomposition with 6 (open) 2-cells, 12 (open) 1-cells and 8 0-cells –2-cell is an open rectangle, or something distortable (homotopically equivalent) to this, e.g. an open disk—face of cube. –A 1-cell is an open interval or something distortable (homotopically equivalent) to an open interval: e.g. the curved part of the boundary of a semicircle, without the end points– edge of cube –A 0-cell is point—corner of cube. Consider a compact topological space/manifold/cell complex X (includes cube, sphere world, sphere) with a (not necessarily unique) cell-decomposition K. Suppose there are α q q-cells in K. The Euler characteristic of X is 13 May Morse Theory and Formation Control Note the word compact: it means closed and bounded. R 2 does not qualify. Unit disk minus origin does not qualify. It is possible to fiddle with the definition to handle these issues.

Connection with minima/maxima/saddle points X is a compact topological space/manifold/cell complex with cell decomposition K. f is a smooth function on X; critical points isolated with Hessians nonsingular. m j is the number of critical points of f of index j. Then the Morse equality holds: Sometimes one must cheat a bit with f. –For example, f may have to be increasing all along the boundary of X, if there is a boundary. (This is a bit like requiring when discussing R n that f goes to infinity as x goes to infinity). 13 May Morse Theory and Formation Control

Euler characteristic for closed disk in R 2 Consider the closed unit disk in R 2. It is the union of: –The open unit disk in R 2 (α 2 =1) –The circumference of the unit disk, less an identified single point— which is homotopic to an open interval (α 1 =1) –The identified single point on the circumference (α 0 =1) 13 May Morse Theory and Formation Control =++

Euler characteristic for closed disk in R 2 It is also the union of: –Two open regions bounded by semicircles (α 2 =2) –The diameter lying between the semicircles, less its endpoints, plus two circular arcs, open at each end, associated with the two semicircles (α 1 =3) –Two points (α 0 =2) 13 May Morse Theory and Formation Control =++

Euler characteristic for closed disk in R 2 Consider the closed unit disk in R 2. It is the union of: –The open unit disk in R 2 (α 2 =1) –The circumference of the unit disk, less an identified single point— which is homotopic to an open interval (α 1 =1) –The identified single point on the circumference (α 0 =1) It is also the union of: –Two open regions bounded by semicircles (α 2 =2) –The diameter lying between the semicircles, less its endpoints, plus two circular arcs, open at each end, associated with the two semicircles (α 1 =3) –Two points (α 0 =2) 13 May Morse Theory and Formation Control

Euler characteristic for closed disk in R n Consider the closed unit disk in R n [x 1 2 +x 2 2 +…x n 2 ≤1]. It is the union of: –The open unit disk in R n : [x 1 2 +x 2 2 +…x n 2 <1] (α n =1) –The unit disk boundary [x 1 2 +x 2 2 +…x n 2 =1], (which is the sphere S n-1 ) less an identified single point (e.g. [0,0…,0,1]) This boundary less the single point is the same as points satisfying x 1 2 +x 2 2 +…x n 2 =1 and x n ≠ 1, or equivalently x 1 2 +x 2 2 +…x n-1 2 <1, which is the unit disk D n-1 (α n-1 =1) –The identified single point on the sphere S n-1 (α 0 =1) Therefore 13 May Morse Theory and Formation Control This argument generalizes to arbitrary n:

Euler characteristic for closed disk in R n Consider the closed unit disk in R n [x 1 2 +x 2 2 +…x n 2 ≤1]. It is the union of: –The open unit disk in R n : [x 1 2 +x 2 2 +…x n 2 <1] (α n =1) –The unit disk boundary [x 1 2 +x 2 2 +…x n 2 =1], (which is the sphere S n-1 ) less an identified single point (e.g. [0,0…,0,1]) This boundary less the single point is the same as points satisfying x 1 2 +x 2 2 +…x n 2 =1 and x n ≠ 1, or equivalently x 1 2 +x 2 2 +…x n-1 2 <1, which is the unit disk D n-1 (α n-1 =1) –The identified single point on the sphere S n-1 (α 0 =1) Therefore 13 May Morse Theory and Formation Control

Euler characteristic of S 2, S n It is also easy to get the Euler characteristic of S 2 or S n. S 2 is the union of – its surface x x 2 2 +x 3 2 =1 minus an identified point, say [0,0,1], –And the identified point. The surface x x 2 2 +x 3 2 =1 minus the point [0,0,1] is the same as x x 2 2 <1, which is the unit disk. Thus α 2 =1, α 1 =0, α 0 =1. So More generally In particular, 13 May Morse Theory and Formation Control

Euler characteristic of S 2, S n It is also easy to get the Euler characteristic of S 2 or S n. S 2 is Also 13 May Morse Theory and Formation Control Sphere = 2 hemispheres + equator 1 hemisphere is like 1 open disk (α 2 =2) 1 equator is like open interval line plus single point (α 1 =1, α 0 =1) α α 1 + α 0 = 2

What is Morse Theory and our Motivation? Simple Example of Morse Theory Koditschek’s Navigation Function Problem Euler Characteristic Koditschek’s problem and Euler Characteristic Formation Shape Control Conclusions 30 Outline 13 May 2011 Morse Theory and Formation Control

Euler Characteristic of sphere world One large sphere bounds the workspace (closed disk): M smaller spheres bound the obstacles: The robot operates in the free space A finite cellular decomposition of workspace is provided by a finite cellular decomposition of free space plus obstacles Hence : 13 May Morse Theory and Formation Control

Key conclusions: With one or more obstacles, the Euler characteristic cannot be 1. Suppose one designs a potential function such that its gradient points outwards on the boundaries of the free space The Morse equality then holds: m 0 – m 1 + m 2 - …= 1 - M( -1) n Suppose there is a unique attracting equilibrium point. With M>0, there are necessarily saddles and or maxima for V(x) in the free space. This arises no matter what V(x) is used. We may be able to determine more if we use Morse inequalities as well! 13 May Morse Theory and Formation Control

What is Morse Theory and our Motivation Simple Example of Morse Theory Koditschek’s Navigation Function Problem Euler Characteristic Koditschek’s problem and Euler Characteristic Formation Shape Control Conclusions 33 Outline 13 May 2011 Morse Theory and Formation Control

Formation Shape Control Consider a set of point agents, and a sufficient number of specified distance pairs d * ij between agents i,j that the shape of the formation is thereby specified. –Rigidity theory sorts out sets of allowed distance pairs. –Translation and rotation are permitted with the specification. Suppose the actual formation shape at time t is defined by distances d ij and a control law is adopted to move these values towards the specified values d * ij. This is a formation shape control law. Typically such laws are distributed, rely on sensing certain data etc. Also they are of the gradient descent form Behavior of laws for certain formations are well understood. 13 May Morse Theory and Formation Control

Typical Shape Control Results A triangular formation always converges to a correctly dimensioned triangle, unless the initial formation is collinear. A formation with 4 agents and 6 distances has saddle points but otherwise appears to always converge correctly. Any rigid formation can be locally controlled (at least). 13 May 2011 Morse Theory and Formation Control 35

Example of a typical law May 2011 Morse Theory and Formation Control

A more detailed tool—Betti numbers Betti numbers—all nonnegative integers-- can be defined for various topological spaces, including cell complexes, spheres, disks, R n, C n, and real projective spaces. If a manifold is n-dimensional (example: S 1, the circle is 1- dimensional, the equator of a sphere in R 3 is also 1-dimensional) the Betti numbers beyond β n are all zero. For entities living in R 3, (torus, sphere, cube, etc), there are rules of thumb: –β 0 is number of connected components (pretzel has one) –β 1 is number of holes or tunnels (donut has one) –β 2 is number of voids (sphere has one) 13 May Morse Theory and Formation Control

A more detailed tool—Betti numbers Betti numbers—all nonnegative integers-- can be defined for various topological spaces, including cell complexes, spheres, disks, R n, C n, and real projective spaces. If a manifold is n-dimensional (example: S 1, the circle is 1- dimensional, the equator of a sphere in R 3 is also 1-dimensional) the Betti numbers beyond β n are all zero. No explanation here of how to find them. They are recorded in various text books. Examples: 13 May Morse Theory and Formation Control

Betti numbers—one or two facts Let A be a topological space with Betti numbers. Then Suppose Betti numbers β iA, β iB, correspond to topological spaces A,B. Define C = A× B. Then 13 May Morse Theory and Formation Control

Morse Inequalities and Equalities Suppose f is a smooth function on the space A with –Isolated critical points –Nonsingular second derivative at the critical points –Maybe having some constraint at the boundary –m j critical points with index j 13 May Morse Theory and Formation Control

The space of formations To apply this to the formation shape control problem, we need to know what is the topological space A, and its associated Betti numbers The space has been worked out by Kendall. Neglecting formations in which all points are collocated, 13 May Morse Theory and Formation Control In an ambient two-dimensional space, the space of formations of n point agents can be represented as Some intuition: R + takes care of a scaling. CP n-2 is meant to take care of all formations neglecting scaling—paying no attention to translation or rotation. Park agent 1 at origin. Plot other n-2 agents in complex plane. After scaling and allowing for rotations, a lengthy argument gives CP n-2. R + accounts for one degree of freedom, and CP n-2 for another 2n-4.

Morse inequalities and equality for formation The Betti numbers for the space of formations can be computed from the product formula and knowledge of Betti numbers for R + and CP n-2. –An adjustment can be made for the all-collocated formation, which always corresponds to a maximum of the function V(x). For distance-based control laws, the equations are: 13 May Morse Theory and Formation Control Triangle Case

A general conclusion Look at the first three inequalities. They show you cannot have m 0 =1 or 2, and m 1, m 2 both zero. So there will always be unwanted equilibrium points, not matter what form of gradient descent law is used. 13 May Morse Theory and Formation Control

Triangular Formations A collection of control laws have been found, which are similar. Following remarks apply to almost all laws. There are two correct equilibria, which are mirror images of one another There is one maximum, with all points collocated There are three saddle points with one unstable mode with the three agents collinear; they differ according to which agent is between other two There are three saddle points with two unstable modes with two agents collocated and the third placed distinctly (this is new) Summing up: m 0 = 2, m 1 = 3, m 2 = 3, m 3 = 1 One strict equality and three inequalities follow. There is nothing about the Morse inequalities/equality that forces m 0 to be 1 or 2; thus incorrect stable equilibria are not automatically precluded. 13 May Morse Theory and Formation Control

Formations with four agents Over the past several years, formations with four agents have been intensively studied. –They may have five distance links (rigidity) –They may have six distance links (global rigidity/complete graph) At this stage, there is no complete analysis of all the equilibria. It is known for the five link case there are stable equilibria which are not congruent (flip ambiguity) but have correct distances For the six distance link case, it is not known if all stable equilibria are correct. However, it may be possible to identify m j for j>0, and then m 0 (=2?) would follow. 13 May Morse Theory and Formation Control

What is Morse Theory and our Motivation Simple Example of Morse Theory Koditschek’s Navigation Function Problem Euler Characteristic Koditschek’s problem and Euler Characteristic Formation Shape Control Conclusions 46 Outline 13 May 2011 Morse Theory and Formation Control

Conclusions Morse theory can be used to obtain relations among the number of equilibrium points of different type for a control system using a steepest descent control law. Work must be done to define the topological space in which the underlying system lies Betti numbers must be obtained for the topological space in order that the Morse inequalities/equality can be recorded For the navigation problem and the formation shape stabilization problem based on distances, there are always incorrect equilibria, but they may be saddle points or unstable. 13 May Morse Theory and Formation Control

Some open issues Classify equilibria for four agent formations –Maybe show that with a complete graph, all stable equilibria have correct distances Identify particular results for n>4 agent formations Handling formations in R 3 : issue is what space to use to describe them (space is needed for Betti numbers) Analyse bearing-based control laws. Consider the possibility of dealing with control laws which are not gradient descent 13 May Morse Theory and Formation Control

References Y. Matsumoto, An Introduction to Morse Theory, American Mathematical Society, Providence, RI, J. Milnor, Morse Theory, Princeton University Press, Princeton, NJ, 1969 D.E. Koditschek and E. Rimon, Robot Navigation Functions on Manifolds with Boundary, Advances in Applied Math., vol. 11, 1990, pp B.D.O. Anderson, Morse Theory and Formation Control, 19th Mediterranean Conference on Control and Automation, to appear. D.G. Kendall, A Survey of the Statistical Theory of Shape, Statistical Science, vol. 4, 1989, pp May Morse Theory and Formation Control