{"id":{"repo_id":"unm","oai_identifier":"oai:digitalrepository.unm.edu:math_etds-1030"},"canonical_url":"https://search.dev.ndltd.org/etd/unm/oai:digitalrepository.unm.edu:math_etds-1030","repository":{"repo_id":"unm","name":"University of New Mexico","base_url":"https://digitalrepository.unm.edu/do/oai/"},"display":{"title":"Optimal control problems, curves of pursuit","abstract":"We study a class of problems known as pursuit-evasion problems (PE). These problems can be understood as special cases of optimal control problems. After describing the two main principles to study optimal control problems, namely Pontryagin's maximum principle and Bellman's method of dynamic programming, this thesis focuses on specific examples of PE problems within the classes of pursuit problems, evasion problems, and pursuit-evasion problems.","abstract_html":"We study a class of problems known as pursuit-evasion problems (PE). These problems can be understood as special cases of optimal control problems. After describing the two main principles to study optimal control problems, namely Pontryagin's maximum principle and Bellman's method of dynamic programming, this thesis focuses on specific examples of PE problems within the classes of pursuit problems, evasion problems, and pursuit-evasion problems.","abstract_has_math":false,"creators":["Moiseeva, Svetlana"],"institution":null,"degree_name":"Mathematics","degree_level":"Masters","degree_discipline":"Mathematics & Statistics","degree_department":null,"school":null,"contributors":["Embid, Pedro","Pedro Embid","Michael Nakamaye","Stephen Lau"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-07-01T07:00:00Z","date_published":"2011-07-01T07:00:00Z","updated_at":"2026-07-24T05:27:37Z","subjects":["Trajectory optimization","Control theory","Differential games","Pontrjagin duality","Dynamic programming."],"languages":["English"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalrepository.unm.edu/math_etds/31"],"render_values":[{"text":"https://digitalrepository.unm.edu/math_etds/31","href":"https://digitalrepository.unm.edu/math_etds/31","code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/1928/12820","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Embid, Pedro","Pedro Embid","Michael Nakamaye","Stephen Lau"]},{"key":"dc:creator","label":"Author","values":["Moiseeva, Svetlana"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics & Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters","Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Trajectory optimization","Control theory","Differential games","Pontrjagin duality","Dynamic programming."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/1928/12820","https://digitalrepository.unm.edu/math_etds/31"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["We study a class of problems known as pursuit-evasion problems (PE). These problems can be understood as special cases of optimal control problems. After describing the two main principles to study optimal control problems, namely Pontryagin's maximum principle and Bellman's method of dynamic programming, this thesis focuses on specific examples of PE problems within the classes of pursuit problems, evasion problems, and pursuit-evasion problems."]},{"key":"dc:title","label":"Title","values":["Optimal control problems, curves of pursuit"]}]}],"canonical_facts":{"dc:contributor":["Embid, Pedro","Pedro Embid","Michael Nakamaye","Stephen Lau"],"dc:creator":["Moiseeva, Svetlana"],"dc:description.abstract":["We study a class of problems known as pursuit-evasion problems (PE). These problems can be understood as special cases of optimal control problems. After describing the two main principles to study optimal control problems, namely Pontryagin's maximum principle and Bellman's method of dynamic programming, this thesis focuses on specific examples of PE problems within the classes of pursuit problems, evasion problems, and pursuit-evasion problems."],"dc:identifier":["http://hdl.handle.net/1928/12820","https://digitalrepository.unm.edu/math_etds/31"],"dc:language":["English"],"dc:subject":["Trajectory optimization","Control theory","Differential games","Pontrjagin duality","Dynamic programming."],"dc:title":["Optimal control problems, curves of pursuit"],"thesis:degree_discipline":["Mathematics & Statistics"],"thesis:degree_level":["Masters","Thesis"],"thesis:degree_name":["Mathematics"]},"updated_at":"2026-07-24T05:27:37Z"}