Aerospace Control and Guidance Systems Committee

Announcements


You must first log in to access prior meeting presentations, register for a meeting, or nominate some for the Ward Award.


If you do not have a login account, or cannot remember the email address associated with your account, please click on the Application Form link below.

 
 

Login

 

E-mail: 

 

Password: 


Forgot your password?

Application Form


 

Site Search

Search our site:
 
 

Upcoming Events


Register for Meeting 132
(please log in first)

 
 

Photos


Meeting Highlights New!

Subcommittee S

 
 

Prior Meetings

Abstracts may be viewed by anyone. Presentations are only available to active members who have logged in.

Meeting 132
(coming soon)

Meeting 131

Meeting 130

Meeting 129

Meeting 128

Meeting 127

Meeting 126

Meeting 125

Meeting 124

Meeting 123

Meeting 122

Meeting 121

Meeting 120

Meeting 119

Meeting 118

Meeting 117

Meeting 116

Meeting 115

Meeting 114

Meeting 113

Meeting 112

Meeting 111

Meeting 110

Meeting 109

Meeting 108

Meeting 107

Meeting 106

Meeting 105

Meeting 104

Meeting 103

Meeting 102

Meeting 101

Meeting 100

Meeting 99

Meeting 98

Meeting 97

Meeting 96

Meeting 95

Meeting 94

Meeting 93

Meeting 92

 
HomeWard Memorial AwardPlanning Advisory BoardDownloadsConstitution and By-LawsAboutHistoryContact Us

  ← Return to agenda

MeetingACGS Committee Meeting 111 - Reno, Nevada - March 2013
Agenda Location5 SUBCOMMITTEE C – AVIONICS AND SYSTEM INTEGRATION
5.3 Verifiable Real-time Convex Optimization of Autonomous Vehicles with Application to Mars Entry, Descent, and Landing
TitleVerifiable Real-time Convex Optimization of Autonomous Vehicles with Application to Mars Entry, Descent, and Landing
PresenterBehcet Acikmese
AffiliationUniversity of Texas
Available Downloads*presentation
*Downloads are available to members who are logged in and either Active or attended this meeting.
AbstractVerifiable Real-Time Convex Optimization for Control of Autonomous Vehicles: Mars Landing from MSL to Precision Landing

Many future engineering applications will require dramatic increases in our existing Autonomous GN&C (Guidance, Navigation and Control) capabilities. These include robotic sample return missions to planets, comets, and asteroids, formation flying spacecraft applications, applications utilizing swarms of autonomous agents, unmanned aerial, ground, and underwater vehicles, and autonomous commercial robotic applications. The main GN&C challenge for many autonomous systems is to achieve the performance goals safely with minimal resource use in the presence of mission constraints and uncertainties. A key difficulty in meeting this challenge is the ability to solve these complex GN&C decision making problems autonomously onboard.

The majority of the advanced autonomous GN&C problems are constrained optimization problems. However, optimization has traditionally been regarded as unsuitable for onboard autonomous use in space applications, mainly because there are hard requirements to guarantee obtaining a solution autonomously in real-time and with limited onboard processing. While satisfying these requirements for general optimization problems may not be possible, the Convex Optimization problems can be solved quickly to global optimality in a predetermined number of computations, that is, we can guarantee finding an optimal solution without a human in the loop. This makes convex optimization a powerful tool to meet the onboard autonomous GN&C challenges.

Our research has provided new analytical results that enabled the formulation of many autonomous GN&C problems in a convex optimization framework. Our analytical framework also allowed precise computation of what the performance bounds are, e.g., the bounds of agility for a vehicle, so that we can make accurate quantification of the capabilities enabled. This proved to be an important step in rigorous V&V of the resulting control decision making algorithms.

This presentation introduces an important real-world example, planetary pinpoint landing, where this approach produced dramatically improved performance over the heritage technology. We developed a novel “lossless convexification” method of solution, which will enable the next generation planetary missions, such as Mars robotic sample return and manned missions.

Biographical Sketch:
Behcet Acikmese is an Assistant Professor in the Department of Aerospace Engineering and Engineering Mechanics at the University of Texas at Austin. He received his Ph.D. in Aerospace Engineering in 2002 from Purdue University. He was a Visiting Assistant Professor of Aerospace Engineering at Purdue University before joining NASA Jet Propulsion Laboratory (JPL) in 2003. He was a senior technologist at JPL and a lecturer in GALCIT at Caltech. At JPL, Dr. Acikmese developed GN&C algorithms for planetary landing, formation flying spacecraft, and asteroid and comet sample return missions. He was the developer of the \y-away" GN&C algorithms in Mars Science Laboratory, which successfully landed on Mars in August 2012. His convex optimization based planetary landing algorithm is currently being flight-tested for future Mars missions.



Copyright © 2024 | Question? webmaster@acgsc.org