Graph process specifications for hybrid networked systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 1303234 (Why is no real title available?)
- scientific article; zbMATH DE number 1956648 (Why is no real title available?)
- A Characterization of Convex Problems in Decentralized Control$^ast$
- A unified framework for hybrid control: model and optimal control theory
- Connectivity graphs as models of local interactions
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Consensus and Cooperation in Networked Multi-Agent Systems
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Control using logic-based switching. Workshop, in the fall of 1995, Block Island, RI, USA
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Distributed control of spatially invariant systems
- Flocking in Fixed and Switching Networks
- Gradient descent approach to optimal mode scheduling in hybrid dynamical systems
- Graph process specifications for hybrid networked systems
- Graph theoretic methods in multiagent networks
- Local Control Strategies for Groups of Mobile Autonomous Agents
- On the Hybrid Optimal Control Problem: Theory and Algorithms
- On the regularization of Zeno hybrid automata
- Optimal Control of Spatially Distributed Systems
- Optimal control of switched systems via non-linear optimization based on direct differentiations of value functions
- Stability analysis of one-dimensional asynchronous swarms
- Transition-Time Optimization for Switched-Mode Dynamical Systems
Cited in
(2)
This page was built for publication: Graph process specifications for hybrid networked systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q351747)
