Jump to ContentJump to Main Navigation
Bayesian BrainProbabilistic Approaches to Neural Coding$
Users without a subscription are not able to see the full content.

Kenji Doya, Shin Ishii, Alexandre Pouget, and Rajesh P.N. Rao

Print publication date: 2006

Print ISBN-13: 9780262042383

Published to MIT Press Scholarship Online: August 2013

DOI: 10.7551/mitpress/9780262042383.001.0001

Show Summary Details
Page of

PRINTED FROM MIT PRESS SCHOLARSHIP ONLINE (www.mitpress.universitypressscholarship.com). (c) Copyright The MIT Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in MITSO for personal use (for details see http://www.mitpress.universitypressscholarship.com/page/privacy-policy).date: 19 June 2018

Optimal Control Theory

Optimal Control Theory

Chapter:
(p.268) (p.269) 12 Optimal Control Theory
Source:
Bayesian Brain
Author(s):

Emanuel Todorov

Publisher:
The MIT Press
DOI:10.7551/mitpress/9780262042383.003.0012

Optimal control theory is a mathematical discipline for studying the neural control of movement. This chapter presents a mathematical introduction to optimal control theory and discusses the following topics: Bellman equations, Hamilton-Jacobi-Bellman equations, Ricatti equations, and Kalman filter. It also examines the duality of optimal control and optimal estimation, and, finally, describes optimal control models and suggests future research directions.

Keywords:   optimal control theory, neural control, movement, Bellman equations, Ricatti equations, Kalman filter, optimal estimation

MIT Press Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs, and if you can't find the answer there, please contact us.