kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Motion Planning for The Estimation of Functions
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).ORCID iD: 0000-0001-9940-5929
2023 (English)In: 2023 62nd IEEE Conference on Decision and Control, CDC 2023, Institute of Electrical and Electronics Engineers (IEEE) , 2023, p. 7150-7155Conference paper, Published paper (Refereed)
Abstract [en]

We consider the problem of estimation of an unknown real valued function with real valued input by an agent. The agent exists in 3D Euclidean space. It is able to traverse in a 2D plane while the function is depicted in a 2D plane perpendicular to the plane of traversal. By viewing the function from a given position, the agent is able to collect a data point lying on the function. By traversing through the plane while paying a control cost, the agent collects a finite set of data points. The set of data points are used by the agent to estimate the function. The objective of the agent is to find a control law which minimizes the control cost while estimating the function optimally. We formulate a control problem for the agent incorporating an inference cost and the control cost. The control problem is relaxed by finding a lower bound for the cost function. We present a kernel based linear regression model to approximate the cost-to-go and use the same in a control algorithm to solve the relaxed optimization problem. We present simulation results comparing the proposed approach with greedy algorithm based exploration.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2023. p. 7150-7155
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-343742DOI: 10.1109/CDC49753.2023.10383869ISI: 001166433805138Scopus ID: 2-s2.0-85184821325OAI: oai:DiVA.org:kth-343742DiVA, id: diva2:1839937
Conference
62nd IEEE Conference on Decision and Control, CDC 2023, Singapore, Singapore, Dec 13 2023 - Dec 15 2023
Note

Part of ISBN 979-835030124-3

QC 20240222

Available from: 2024-02-22 Created: 2024-02-22 Last updated: 2024-12-03Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Raghavan, AneeshSartori, GiacomoJohansson, Karl H.

Search in DiVA

By author/editor
Raghavan, AneeshSartori, GiacomoJohansson, Karl H.
By organisation
Decision and Control Systems (Automatic Control)
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 24 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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