arXiv (All)
open access
Minimum Time Consensus of Multi-agent System under Fuel Constraints
This work addresses the problem of finding the minimum time consensus point in the state space for a set of $N$ identical double integrator agents with bounded input and fixed fuel budget constraints. The attainable set of each agent under these constraints is computed, and its boundary is used to c
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An Evolutionary Algorithm for Actuator-Sensor-Communication Co-Design in Distributed Control#1036671
- Optimal Design and Scheduling of a Multi-Vector Energy System for Green Hydrogen and Electricity#615387
- Finite control set model predictive control for dynamic reactive power compensation with hybrid active power filters#647715
- A unified approach to cross-intersection problems with applications to Hilton--Milner type theorems and stability#793768
- A unified approach to cross-intersection problems with applications to Hilton--Milner type theorems and stability#789763
Record · ID 1458149
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive