Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On Cooperative Surveillance, Online Trajectory Planning and Observer Based Control
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. (Optimization and Systems Theory)
2009 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

The main body of this thesis consists of six appended papers. In the  first two, different  cooperative surveillance problems are considered. The second two consider different aspects of the trajectory planning problem, while the last two deal with observer design for mobile robotic and Euler-Lagrange systems respectively.In Papers A and B,  a combinatorial optimization based framework to cooperative surveillance missions using multiple Unmanned Ground Vehicles (UGVs) is proposed. In particular, Paper A  considers the the Minimum Time UGV Surveillance Problem (MTUSP) while Paper B treats the Connectivity Constrained UGV Surveillance Problem (CUSP). The minimum time formulation is the following. Given a set of surveillance UGVs and a polyhedral area, find waypoint-paths for all UGVs such that every point of the area is visible from  a point on a waypoint-path and such that the time for executing the search in parallel is minimized.  The connectivity constrained formulation  extends the MTUSP by additionally requiring the induced information graph to be  kept recurrently connected  at the time instants when the UGVs  perform the surveillance mission.  In these two papers, the NP-hardness of  both these problems are shown and decomposition techniques are proposed that allow us to find an approximative solution efficiently in an algorithmic manner.Paper C addresses the problem of designing a real time, high performance trajectory planner for an aerial vehicle that uses information about terrain and enemy threats, to fly low and avoid radar exposure on the way to a given target. The high-level framework augments Receding Horizon Control (RHC) with a graph based terminal cost that captures the global characteristics of the environment.  An important issue with RHC is to make sure that the greedy, short term optimization does not lead to long term problems, which in our case boils down to two things: not getting into situations where a collision is unavoidable, and making sure that the destination is actually reached. Hence, the main contribution of this paper is to present a trajectory planner with provable safety and task completion properties. Direct methods for trajectory optimization are traditionally based on a priori temporal discretization and collocation methods. In Paper D, the problem of adaptive node distribution is formulated as a constrained optimization problem, which is to be included in the underlying nonlinear mathematical programming problem. The benefits of utilizing the suggested method for  online  trajectory optimization are illustrated by a missile guidance example.In Paper E, the problem of active observer design for an important class of non-uniformly observable systems, namely mobile robotic systems, is considered. The set of feasible configurations and the set of output flow equivalent states are defined. It is shown that the inter-relation between these two sets may serve as the basis for design of active observers. The proposed observer design methodology is illustrated by considering a  unicycle robot model, equipped with a set of range-measuring sensors. Finally, in Paper F, a geometrically intrinsic observer for Euler-Lagrange systems is defined and analyzed. This observer is a generalization of the observer proposed by Aghannan and Rouchon. Their contractivity result is reproduced and complemented  by  a proof  that the region of contraction is infinitely thin. Moreover, assuming a priori bounds on the velocities, convergence of the observer is shown by means of Lyapunov's direct method in the case of configuration manifolds with constant curvature.

Place, publisher, year, edition, pages
Stockholm: KTH , 2009. , xii, 53 p.
Series
Trita-MAT. OS, ISSN 1401-2294 ; 2009:03
Keyword [en]
Surveillance Missions, Minimum-Time Surveillance, Unmanned Ground Vehicles, Connectivity Constraints, Combinatorial Optimization, Computational Optimal Control, Receding Horizon Control, Mission Uncertainty, Safety, Task Completion, Adaptive Grid Methods, Missile Guidance, Nonlinear Observer Design, Active Observers, Non--uniformly Observable Systems, Mobile Robotic Systems, Intrinsic Observers, Differential Geometric Methods, Euler-Lagrange Systems, Contraction Analysis.
National Category
Computational Mathematics Computational Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-9990ISBN: 978-91-7415-246-3 (print)OAI: oai:DiVA.org:kth-9990DiVA: diva2:202389
Public defence
2009-04-01, E2, Linstedtsvägen 3, KTH, 10:00 (English)
Opponent
Supervisors
Projects
TAIS, AURES
Note
QC 20100622Available from: 2009-03-12 Created: 2009-02-25 Last updated: 2010-07-19Bibliographically approved
List of papers
1. Adaptive Node Distribution for Online Trajectory Planning
Open this publication in new window or tab >>Adaptive Node Distribution for Online Trajectory Planning
(English)Manuscript (Other academic)
National Category
Computational Mathematics
Identifiers
urn:nbn:se:kth:diva-6265 (URN)
Note
QC 20100622Available from: 2006-10-15 Created: 2006-10-15 Last updated: 2010-07-19Bibliographically approved
2. Riemannian Observers for Euler-Lagrange Systems
Open this publication in new window or tab >>Riemannian Observers for Euler-Lagrange Systems
2005 (English)In: Proceedings of the 16th IFAC World Congress: Prague, Czech Republic, July 3-8, 2005, 2005, 115-120 p.Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, a geometrically intrinsic observer for Euler-Lagrange systems is defined and analysed. This observer is an generalization of the observer recently proposed by Aghannan and Rouchon. Their contractivity result is reproduced and complemented by a proof that the region of contractivity is infinitely thin. However, assuming a priori bounds on the velocities, convergence of the observer is shown by means of Lyapunov's direct method in the case of configuration manifolds with constant curvature. The convergence properties of the observer are illustrated by an example where the configuration manifold is the three-dimensional sphere, S3.

Series
IFAC Proceedings Volumes (IFAC-PapersOnline), ISSN 1474-6670 ; 16
Keyword
Contraction, Differential geometric methods, Euler-lagrange systems, Intrinsic observers, Nonlinear observers, Nonlinear systems theory
National Category
Computational Mathematics
Identifiers
urn:nbn:se:kth:diva-6267 (URN)2-s2.0-79960723494 (Scopus ID)008045108X (ISBN)9780080451084 (ISBN)
Conference
16th Triennial World Congress of International Federation of Automatic Control, IFAC 2005; Prague; Czech Republic; 3 July 2005 through 8 July 2005
Note

QC 20100622. Updated from manuscript to conference paper.

Available from: 2006-10-15 Created: 2006-10-15 Last updated: 2014-11-27Bibliographically approved
3. Active Observers for Mobile Robotic Systems
Open this publication in new window or tab >>Active Observers for Mobile Robotic Systems
(English)Manuscript (Other academic)
Abstract [en]

An important class of non-uniformly observable systems come from applications in mobile robotics. In this paper, the problem of active observer design for such systems is considered. The set of feasible configurations and the set of output flow equivalent states is defined. It is shown that the inter-relation between these two sets serves as the basis for design of active observers. The proposed observer design method is illustrated by considering a unicycle robot model, equipped with a set of range-measuring sensors.

National Category
Computational Mathematics
Identifiers
urn:nbn:se:kth:diva-6266 (URN)
Note
QC 20100622Available from: 2006-10-15 Created: 2006-10-15 Last updated: 2010-07-19Bibliographically approved
4. Online Trajectory Planning for Aerial Vehicle: A Safe Approach with Guaranteed Task Completion
Open this publication in new window or tab >>Online Trajectory Planning for Aerial Vehicle: A Safe Approach with Guaranteed Task Completion
(English)Manuscript (Other academic)
Abstract [en]

On-line trajectory optimization in three dimensional space is the main topic of the paper at hand. The high-level framework augments on-line receding horizon control with an off-line computed terminal cost that captures the global characteristics of the environment, as well as any possible mission objectives. The first part of the paper is devoted to the single vehicle case while the second part considers the problem of simultaneous arrival of multiple aerial vehicles. The main contribution of the first part is two-fold. Firstly, by augmenting a so called safety maneuver at the end of the planned trajectory, this paper extends previous results by addressing provable safety properties in a 3D setting. Secondly, assuming initial feasibility, the planning method presented is shown to have finite time task completion. Moreover, a quantitative comparison between the two competing objectives of optimality and computational tractability is made. Finally, some other key characteristics of the trajectory planner, such as ability to minimize threat exposure and robustness, are highlighted through simulations. As for the simultaneous arrival problem considered in the second part, by using a time-scale separation principle, we are able to adopt standard Laplacian control to a consensus problem which is neither unconstrained, nor first order. 

National Category
Computational Mathematics
Identifiers
urn:nbn:se:kth:diva-6264 (URN)
Note
QC 20100622Available from: 2006-10-15 Created: 2006-10-15 Last updated: 2011-11-21Bibliographically approved

Open Access in DiVA

fulltext(0 kB)606 downloads
File information
File name FULLTEXT01.pdfFile size 0 kBChecksum SHA-512
4f37bd53b094746ef91aba8a12fd93d3955e9c3a6d3ed025834c54a64897c24978bfad7596bee9b947fff074ddea7052774c9b967b396b7430fbe927762990bc
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Anisi, David A.
By organisation
Optimization and Systems Theory
Computational MathematicsComputational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 606 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 535 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf