Jin Dai
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jin Dai has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Hai Lin
Department of Chemistry, University of Colorado Denver, Denver, CO 80217, USA
10 shared publications - Bo Wu
Department of Aerospace Engineering and Engineering Mechanics, University of Texas at Austin, Austin, TX, USA
6 shared publications - Zhiyu Liu
Department of Electrical Engineering University of Notre Dame
3 shared publications - Alessandro Benini1 shared publication
- Bo Wu
Univ Texas Austin, Oden Inst Computat Engn & Sci, Austin, TX 78712 USA
1 shared publication - Kimon P. Valavanis
Ritchie School of Engineering and Computer Science, University of Denver, Denver, USA
1 shared publication
Latest Publications
- 9 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 7 (4) , 1801-1811
Distributed Communication-Aware Motion Planning for Networked Mobile Robots Under Formal Specifications
Control and communication are often tightly coupled for networked mobile robots; motions of robots impact communication quality, and communication quality of service (QoS) in turn affects coordination performance of robots. In this paper, we propose a theoretical motion planning control framework for a team of networked mobile robots to accomplish high-level spatial and temporal motion specifications while optimizing communication QoS. Desired motion specifications are formulated as Signal Temporal Logic (STL), whereas the communication QoS to be optimized is captured by Spatial Temporal Reach and Escape Logic (STREL) formulas. Both the STL and STREL specifications are encoded as mixed integer linear constraints posed on the system and environment state variables of the mobile robot network, where satisfactory control strategies can be computed by exploiting a distributed model predictive control (MPC) approach. A two-layer hierarchical MPC procedure is proposed to efficiently solve the co-optimization problem, whose recursive feasibility is formally ensured. The effectiveness of the proposed framework is validated by simulation.
- 9 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 7 (4) , 1801-1811
Distributed Communication-Aware Motion Planning for Networked Mobile Robots Under Formal Specifications
Control and communication are often tightly coupled for networked mobile robots; motions of robots impact communication quality, and communication quality of service (QoS) in turn affects coordination performance of robots. In this paper, we propose a theoretical motion planning control framework for a team of networked mobile robots to accomplish high-level spatial and temporal motion specifications while optimizing communication QoS. Desired motion specifications are formulated as Signal Temporal Logic (STL), whereas the communication QoS to be optimized is captured by Spatial Temporal Reach and Escape Logic (STREL) formulas. Both the STL and STREL specifications are encoded as mixed integer linear constraints posed on the system and environment state variables of the mobile robot network, where satisfactory control strategies can be computed by exploiting a distributed model predictive control (MPC) approach. A two-layer hierarchical MPC procedure is proposed to efficiently solve the co-optimization problem, whose recursive feasibility is formally ensured. The effectiveness of the proposed framework is validated by simulation.
- Open Access
Coordination and Control of Distributed Discrete Event Systems under Actuator and Sensor Faults
We investigate the coordination and control problems of distributed discrete event systems that are composed of multiple subsystems subject to potential actuator and/or sensor faults. We model actuator faults as local controllability loss of certain actuator events and sensor faults as observability failure of certain sensor readings, respectively. Starting from automata-theoretic models that characterize behaviors of the subsystems in the presence of faulty actuators and/or sensors, we establish necessary and sufficient conditions for the existence of actuator and sensor fault tolerant supervisors, respectively, and synthesize appropriate local post-fault supervisors to prevent the post-fault subsystems from jeopardizing local safety requirements. Furthermore, we apply an assume-guarantee coordination scheme to the controlled subsystems for both the nominal and faulty subsystems so as to achieve the desired specifications of the system. A multi-robot coordination example is used to illustrate the proposed coordination and control architecture.
Open AccessCoordination and Control of Distributed Discrete Event Systems under Actuator and Sensor Faults
We investigate the coordination and control problems of distributed discrete event systems that are composed of multiple subsystems subject to potential actuator and/or sensor faults. We model actuator faults as local controllability loss of certain actuator events and sensor faults as observability failure of certain sensor readings, respectively. Starting from automata-theoretic models that characterize behaviors of the subsystems in the presence of faulty actuators and/or sensors, we establish necessary and sufficient conditions for the existence of actuator and sensor fault tolerant supervisors, respectively, and synthesize appropriate local post-fault supervisors to prevent the post-fault subsystems from jeopardizing local safety requirements. Furthermore, we apply an assume-guarantee coordination scheme to the controlled subsystems for both the nominal and faulty subsystems so as to achieve the desired specifications of the system. A multi-robot coordination example is used to illustrate the proposed coordination and control architecture.
- Open Access
Distributed Communication-aware Motion Planning for Networked Mobile Robots under Formal Specifications
Control and communication are often tightly coupled in motion planning of networked mobile robots, due to the fact that robotic motions will affect the overall communication quality, and the quality of service (QoS) of the communication among the robots will in turn affect their coordination performance. In this paper, we propose a control theoretical motion planning framework for a team of networked mobile robots in order to accomplish high-level spatial and temporal motion objectives while optimizing communication QoS. Desired motion specifications are formulated as Signal Temporal Logic (STL), whereas the communication performances to be optimized are captured by recently proposed Spatial Temporal Reach and Escape Logic (STREL) formulas. Both the STL and STREL specifications are encoded as mixed integer linear constraints posed on the system and/or environment state variables of the mobile robot network, where satisfactory control strategies can be computed by exploiting a distributed model predictive control (MPC) approach. To the best of the authors' knowledge, we are the first to study controller synthesis for STREL specifications. A two-layer hierarchical MPC procedure is proposed to efficiently solve the problem, whose soundness and completeness are formally ensured. The effectiveness of the proposed framework is validated by simulation examples.
Open AccessDistributed Communication-aware Motion Planning for Networked Mobile Robots under Formal Specifications
Control and communication are often tightly coupled in motion planning of networked mobile robots, due to the fact that robotic motions will affect the overall communication quality, and the quality of service (QoS) of the communication among the robots will in turn affect their coordination performance. In this paper, we propose a control theoretical motion planning framework for a team of networked mobile robots in order to accomplish high-level spatial and temporal motion objectives while optimizing communication QoS. Desired motion specifications are formulated as Signal Temporal Logic (STL), whereas the communication performances to be optimized are captured by recently proposed Spatial Temporal Reach and Escape Logic (STREL) formulas. Both the STL and STREL specifications are encoded as mixed integer linear constraints posed on the system and/or environment state variables of the mobile robot network, where satisfactory control strategies can be computed by exploiting a distributed model predictive control (MPC) approach. To the best of the authors' knowledge, we are the first to study controller synthesis for STREL specifications. A two-layer hierarchical MPC procedure is proposed to efficiently solve the problem, whose soundness and completeness are formally ensured. The effectiveness of the proposed framework is validated by simulation examples.
- Open Access
Synthesis of Insertion Functions to Enforce Decentralized and Joint Opacity Properties of Discrete-event Systems
Opacity is a confidentiality property that characterizes the non-disclosure of specified secret information of a system to an outside observer. In this paper, we consider the enforcement of opacity within the discrete-event system formalism in the presence of multiple intruders. We study two cases, one without coordination among the intruders and the other with coordination. We propose appropriate notions of opacity corresponding to the two cases, respectively, and propose enforcement mechanisms for these opacity properties based on the implementation of insertion functions, which manipulates the output of the system by inserting fictitious observable events whenever necessary. The insertion mechanism is adapted to the decentralized framework to enforce opacity when no coordination exists. Furthermore, we present a coordination and refinement procedure to synthesize appropriate insertion functions to enforce opacity when intruders may coordinate with each other by following an intersection-based coordination protocol. The effectiveness of the proposed opacity-enforcement approaches is validated through illustrative examples.
Open AccessSynthesis of Insertion Functions to Enforce Decentralized and Joint Opacity Properties of Discrete-event Systems
Opacity is a confidentiality property that characterizes the non-disclosure of specified secret information of a system to an outside observer. In this paper, we consider the enforcement of opacity within the discrete-event system formalism in the presence of multiple intruders. We study two cases, one without coordination among the intruders and the other with coordination. We propose appropriate notions of opacity corresponding to the two cases, respectively, and propose enforcement mechanisms for these opacity properties based on the implementation of insertion functions, which manipulates the output of the system by inserting fictitious observable events whenever necessary. The insertion mechanism is adapted to the decentralized framework to enforce opacity when no coordination exists. Furthermore, we present a coordination and refinement procedure to synthesize appropriate insertion functions to enforce opacity when intruders may coordinate with each other by following an intersection-based coordination protocol. The effectiveness of the proposed opacity-enforcement approaches is validated through illustrative examples.
- Open Access
Learning-based Formal Synthesis of Cooperative Multi-agent Systems
We propose a formal design framework for synthesizing coordination and control policies for cooperative multi-agent systems to accomplish a global mission. The global performance requirements are specified as regular languages while dynamics of each agent as well as the shared environment are characterized by finite automata, upon on which a formal design approach is carried out via divide-and-conquer. Specifically, the global mission is decomposed into local tasks; and local mission supervisors are designed to accomplish these local tasks while maintaining the multi-agent performance by integrating supervisor synthesis with compositional verification techniques; finally, motion plans are automatically synthesized based on the obtained mission plans. We present three modifications of the L* learning algorithm such that they are adapted for the synthesis of the local mission supervisors, the compositional verification and the synthesis of local motion plans, to guarantee that the collective behavior of the agents will ensure the satisfaction of the global specification. Furthermore, the effectiveness of the proposed framework is demonstrated by a detailed experimental study based on the implementation of a multi-robot coordination scenario. The proposed hardware-software architecture, with each robot's communication and localization capabilities, is exploited to examine the automatic supervisor synthesis with inter-robot communication.
Open AccessLearning-based Formal Synthesis of Cooperative Multi-agent Systems
We propose a formal design framework for synthesizing coordination and control policies for cooperative multi-agent systems to accomplish a global mission. The global performance requirements are specified as regular languages while dynamics of each agent as well as the shared environment are characterized by finite automata, upon on which a formal design approach is carried out via divide-and-conquer. Specifically, the global mission is decomposed into local tasks; and local mission supervisors are designed to accomplish these local tasks while maintaining the multi-agent performance by integrating supervisor synthesis with compositional verification techniques; finally, motion plans are automatically synthesized based on the obtained mission plans. We present three modifications of the L* learning algorithm such that they are adapted for the synthesis of the local mission supervisors, the compositional verification and the synthesis of local motion plans, to guarantee that the collective behavior of the agents will ensure the satisfaction of the global specification. Furthermore, the effectiveness of the proposed framework is demonstrated by a detailed experimental study based on the implementation of a multi-robot coordination scenario. The proposed hardware-software architecture, with each robot's communication and localization capabilities, is exploited to examine the automatic supervisor synthesis with inter-robot communication.
- Open Access
Communication-aware Motion Planning for Multi-agent Systems from Signal Temporal Logic Specifications
We propose a mathematical framework for synthesizing motion plans for multi-agent systems that fulfill complex, high-level and formal local specifications in the presence of inter-agent communication. The proposed synthesis framework consists of desired motion specifications in temporal logic (STL) formulas and a local motion controller that ensures the underlying agent not only to accomplish the local specifications but also to avoid collisions with other agents or possible obstacles, while maintaining an optimized communication quality of service (QoS) among the agents. Utilizing a Gaussian fading model for wireless communication channels, the framework synthesizes the desired motion controller by solving a joint optimization problem on motion planning and wireless communication, in which both the STL specifications and the wireless communication conditions are encoded as mixed integer-linear constraints on the variables of the agents' dynamical states and communication channel status. The overall framework is demonstrated by a case study of communication-aware multi-robot motion planning and the effectiveness of the framework is validated by simulation results.
Open AccessCommunication-aware Motion Planning for Multi-agent Systems from Signal Temporal Logic Specifications
We propose a mathematical framework for synthesizing motion plans for multi-agent systems that fulfill complex, high-level and formal local specifications in the presence of inter-agent communication. The proposed synthesis framework consists of desired motion specifications in temporal logic (STL) formulas and a local motion controller that ensures the underlying agent not only to accomplish the local specifications but also to avoid collisions with other agents or possible obstacles, while maintaining an optimized communication quality of service (QoS) among the agents. Utilizing a Gaussian fading model for wireless communication channels, the framework synthesizes the desired motion controller by solving a joint optimization problem on motion planning and wireless communication, in which both the STL specifications and the wireless communication conditions are encoded as mixed integer-linear constraints on the variables of the agents' dynamical states and communication channel status. The overall framework is demonstrated by a case study of communication-aware multi-robot motion planning and the effectiveness of the framework is validated by simulation results.
- Open Access
Distributed Communication-aware Motion Planning for Multi-agent Systems from STL and SpaTeL Specifications
In future intelligent transportation systems, networked vehicles coordinate with each other to achieve safe operations based on an assumption that communications among vehicles and infrastructure are reliable. Traditional methods usually deal with the design of control systems and communication networks in a separated manner. However, control and communication systems are tightly coupled as the motions of vehicles will affect the overall communication quality. Hence, we are motivated to study the co-design of both control and communication systems. In particular, we propose a control theoretical framework for distributed motion planning for multi-agent systems which satisfies complex and high-level spatial and temporal specifications while accounting for communication quality at the same time. Towards this end, desired motion specifications and communication performances are formulated as signal temporal logic (STL) and spatial-temporal logic (SpaTeL) formulas, respectively. The specifications are encoded as constraints on system and environment state variables of mixed integer linear programs (MILP), and upon which control strategies satisfying both STL and SpaTeL specifications are generated for each agent by employing a distributed model predictive control (MPC) framework. Effectiveness of the proposed framework is validated by a simulation of distributed communication-aware motion planning for multi-agent systems.
Open AccessDistributed Communication-aware Motion Planning for Multi-agent Systems from STL and SpaTeL Specifications
In future intelligent transportation systems, networked vehicles coordinate with each other to achieve safe operations based on an assumption that communications among vehicles and infrastructure are reliable. Traditional methods usually deal with the design of control systems and communication networks in a separated manner. However, control and communication systems are tightly coupled as the motions of vehicles will affect the overall communication quality. Hence, we are motivated to study the co-design of both control and communication systems. In particular, we propose a control theoretical framework for distributed motion planning for multi-agent systems which satisfies complex and high-level spatial and temporal specifications while accounting for communication quality at the same time. Towards this end, desired motion specifications and communication performances are formulated as signal temporal logic (STL) and spatial-temporal logic (SpaTeL) formulas, respectively. The specifications are encoded as constraints on system and environment state variables of mixed integer linear programs (MILP), and upon which control strategies satisfying both STL and SpaTeL specifications are generated for each agent by employing a distributed model predictive control (MPC) framework. Effectiveness of the proposed framework is validated by a simulation of distributed communication-aware motion planning for multi-agent systems.
- Open Access
Combined Top-Down and Bottom-Up Approaches to Performance-guaranteed Integrated Task and Motion Planning of Cooperative Multi-agent Systems
We propose a hierarchical design framework to automatically synthesize coordination schemes and control policies for cooperative multi-agent systems to fulfill formal performance requirements, by associating a bottom-up reactive motion controller with a top-down mission plan. On one hand, starting from a global mission that is specified as a regular language over all the agents' mission capabilities, a mission planning layer sits on the top of the proposed framework, decomposing the global mission into local tasks that are in consistency with each agent's individual capabilities, and compositionally justifying whether the achievement of local tasks implies the satisfaction of the global mission via an assume-guarantee paradigm. On the other hand, bottom-up motion plans associated with each agent are synthesized corresponding to the obtained local missions by composing basic motion primitives, which are verified safe by differential dynamic logic (d$\mathcal{L}$), through a Satisfiability Modulo Theories (SMT) solver that searches feasible solutions in face of constraints imposed by local task requirements and the environment description. It is shown that the proposed framework can handle dynamical environments as the motion primitives possess reactive features, making the motion plans adaptive to local environmental changes. Furthermore, on-line mission reconfiguration can be triggered by the motion planning layer once no feasible solutions can be found through the SMT solver. The effectiveness of the overall design framework is validated by an automated warehouse case study.
Open AccessCombined Top-Down and Bottom-Up Approaches to Performance-guaranteed Integrated Task and Motion Planning of Cooperative Multi-agent Systems
We propose a hierarchical design framework to automatically synthesize coordination schemes and control policies for cooperative multi-agent systems to fulfill formal performance requirements, by associating a bottom-up reactive motion controller with a top-down mission plan. On one hand, starting from a global mission that is specified as a regular language over all the agents' mission capabilities, a mission planning layer sits on the top of the proposed framework, decomposing the global mission into local tasks that are in consistency with each agent's individual capabilities, and compositionally justifying whether the achievement of local tasks implies the satisfaction of the global mission via an assume-guarantee paradigm. On the other hand, bottom-up motion plans associated with each agent are synthesized corresponding to the obtained local missions by composing basic motion primitives, which are verified safe by differential dynamic logic (d$\mathcal{L}$), through a Satisfiability Modulo Theories (SMT) solver that searches feasible solutions in face of constraints imposed by local task requirements and the environment description. It is shown that the proposed framework can handle dynamical environments as the motion primitives possess reactive features, making the motion plans adaptive to local environmental changes. Furthermore, on-line mission reconfiguration can be triggered by the motion planning layer once no feasible solutions can be found through the SMT solver. The effectiveness of the overall design framework is validated by an automated warehouse case study.
- 1 December 2015
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 48 (27) , 224-229
Combined Top-down and Bottom-up Approach to Cooperative Distributed Multi-agent Control with Connectivity Constraints**The _nancial supports from NSF-CNS-1239222, NSF-EECS-1253488 and NSF-CNS-1446288 are highly appreciated.
- 1 December 2015
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 48 (27) , 224-229
Combined Top-down and Bottom-up Approach to Cooperative Distributed Multi-agent Control with Connectivity Constraints**The _nancial supports from NSF-CNS-1239222, NSF-EECS-1253488 and NSF-CNS-1446288 are highly appreciated.
- 1 August 2014
- Published by Springer Nature in Control Theory and Technology
- Vol. 12 (3) , 218-233
A learning-based synthesis approach to decentralized supervisory control of discrete event systems with unknown plants
- 1 August 2014
- Published by Springer Nature in Control Theory and Technology
- Vol. 12 (3) , 218-233
A learning-based synthesis approach to decentralized supervisory control of discrete event systems with unknown plants