Leader–Follower Consensus Over Finite Fields

Lin, Lin; Cao, Jinde; Lam, James; Zhu, Shiyong; Azuma, Shun-ichi; Rutkowski, Leszek

doi:10.1109/tac.2024.3354195

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article4

Other1

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 5 publications

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

On synchronization of random nonlinear complex networks

Zhang,

2024

Physica D: Nonlinear Phenomena

View full text Add to dashboard Cite

On synchronization of random nonlinear complex networks

Zhang,

2024

Physica D: Nonlinear Phenomena

View full text Add to dashboard Cite

Minimal‐cost route planning via Fibonacci‐heap‐typed data structure

Zhan,

Qiu,

Min

et al. 2024

IET Control Theory & Appl

View full text Add to dashboard Cite

Efficient route planning in transportation networks, particularly under stochastic conditions like severe weather (i.e. snow or hail), poses a significant computational challenge. This article addresses this challenge by modeling the route planning problem as a Markov decision process (MDP) problem, establishing reachability criteria, and identifying the minimum‐weight arborescence in the directed graph. To achieve this, the reachability determination algorithm is designed to assess the courier company's reachability to all junctions based on the queue‐typed data structure and breadth‐first search idea. Subsequently, the minimal‐cost route planning algorithm is developed to find a feasible transport route with the minimal cost of clearing obstacles by resorting to the Edmonds' algorithm and some feasible data structures. In particular, the article introduces a Fibonacci‐heap‐typed data structure to the minimal‐cost route planning algorithm, resulting in a remarkable reduction of the time complexity from to , where and represent the cardinalities of the arc set and nodeset, respectively. Ultimately, the proposed method is applied to optimize route planning in a transportation network, providing a cost‐efficient solution for logistics and transportation planning.

show abstract

Fully Distributed Model-Free Flocking of Multiple Euler-Lagrange Systems

Long,

Chen,

2024

IEEE Trans. on Signal and Inf. Process. over Networks

View full text Add to dashboard Cite

Leader–Follower Consensus Over Finite Fields

Cited by 5 publications

References 46 publications

On synchronization of random nonlinear complex networks

On synchronization of random nonlinear complex networks

Minimal‐cost route planning via Fibonacci‐heap‐typed data structure

Fully Distributed Model-Free Flocking of Multiple Euler-Lagrange Systems

Contact Info

Product

Resources

About