DocumentCode
2381826
Title
Convexification of the range-only station keeping problem
Author
Cao, M. ; Morse, A.S.
Author_Institution
Dept. of Mech. & Aerosp. Eng., Princeton Univ., Princeton, NJ
fYear
2008
fDate
11-13 June 2008
Firstpage
771
Lastpage
776
Abstract
Using concepts from switched adaptive control theory plus a special parameterization of the class of 2 times 2 nonsingular matrices, a tractable and provably correct solution is given to the three landmark station keeping problem in the plane in which range measurements are the only sensed signals upon which station keeping is to be based. The performance of the overall system degrades gracefully in the face of increasing measurement and miss-alignment errors, provided the measurement errors are not too large.
Keywords
adaptive control; concave programming; mobile robots; position control; time-varying systems; nonsingular matrix parameterization; range-only station keeping problem; switched adaptive control theory; Adaptive control; Autonomous agents; Constraint optimization; Control systems; Cost function; Degradation; Measurement errors; Particle measurements; Position measurement; Symmetric matrices;
fLanguage
English
Publisher
ieee
Conference_Titel
American Control Conference, 2008
Conference_Location
Seattle, WA
ISSN
0743-1619
Print_ISBN
978-1-4244-2078-0
Electronic_ISBN
0743-1619
Type
conf
DOI
10.1109/ACC.2008.4586586
Filename
4586586
Link To Document