Skip to content
AI News HubLIVE
Source content · Analysis pending2 min read

Optimally Trading Energy for Information through Speed Trajectory Optimization of Sustainably Powered Mobile Robots

Summary

arXiv:2610.20875v1 Announce Type: new Abstract: Sustainably powered mobile robots enable long-duration observational missions by harvesting energy from the environment. However, effective autonomy requires the robots to make decisions as to how to allocate this energy to maximize information quality over time. In this paper, we study a persistent (infinite-horizon) speed trajectory optimization problem that is posed as a periodic optimal control problem in which a robot repeatedly traverses a fixed closed path, coupling a super-linear propulsion cost with dynamic information gain and decay. Using the information-theoretic quantity of clarity as an information metric, we first derive the necessary conditions for optimal control. We then derive a number of specialized follow-on properties,…

SourcearXiv RoboticsAuthor: Kavin M. Govindarajan, Dimitra Panagou, Chris Vermillion
Optimally Trading Energy for Information through Speed Trajectory Optimization of Sustainably Powered Mobile Robots
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 14 Oct 2026]

Title:Optimally Trading Energy for Information through Speed Trajectory Optimization of Sustainably Powered Mobile Robots

View a PDF of the paper titled Optimally Trading Energy for Information through Speed Trajectory Optimization of Sustainably Powered Mobile Robots, by Kavin M. Govindarajan and 2 other authors

View PDF HTML (experimental)

Abstract:Sustainably powered mobile robots enable long-duration observational missions by harvesting energy from the environment. However, effective autonomy requires the robots to make decisions as to how to allocate this energy to maximize information quality over time. In this paper, we study a persistent (infinite-horizon) speed trajectory optimization problem that is posed as a periodic optimal control problem in which a robot repeatedly traverses a fixed closed path, coupling a super-linear propulsion cost with dynamic information gain and decay. Using the information-theoretic quantity of clarity as an information metric, we first derive the necessary conditions for optimal control. We then derive a number of specialized follow-on properties, which characterize (i) the nature of the optimal control when points on the path are of varying importance and when they are of equal importance, along with (ii) a high-speed information limit that is approached when energy reserves approach infinity. We illustrate the information-optimal speed trajectories on a simple example in order to showcase key trends that are followed under the optimized speed profile. This is followed by a simulation study based on the persistent characterization of salinity in the Chesapeake Bay, illustrating the practical merit of applying the results from this work.

Subjects:

Robotics (cs.RO); Systems and Control (eess.SY)

Cite as: arXiv:2610.20875 [cs.RO]

(or arXiv:2610.20875v1 [cs.RO] for this version)

https://doi.org/10.48550/arXiv.2610.20875

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Kavin Govindarajan [view email] [v1] Wed, 14 Oct 2026 20:06:11 UTC (1,460 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Optimally Trading Energy for Information through Speed Trajectory Optimization of Sustainably Powered Mobile Robots, by Kavin M. Govindarajan and 2 other authors

View PDF

HTML (experimental)

TeX Source

view license

Additional Features

Audio Summary

Current browse context:

cs.RO

new | recent | 2026-10

Change to browse by:

cs cs.SY eess eess.SY

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

ResearchersAdvanced

Key points

  • AI generation is temporarily unavailable; this entry was preserved with deterministic fallback metadata.
  • arXiv:2610.20875v1 Announce Type: new Abstract: Sustainably powered mobile robots enable long-duration observational missions by harvesting energy from the environment. However, e…

Highlights and analysis are generated automatically and may contain errors. Check the original source.