Multi-agent scheduling problems are common in applications such as intelligent transportation and smart manufacturing. When the agents are non-cooperative and inertially constrained, finding a safe and efficient policy under the trajectory uncertainty of other agents is a non-trivial problem. In this article, we establish a minimax framework to optimize the worst-case scheduling performance under the two-agent model. Specifically, a unified representation is proposed to characterize the trajectory uncertainty of the other agent, and a function is derived to evaluate different target states. Based on this evaluation, we further develop a control policy by adopting the minimax method, where a trajectory leading to the most robust target state is generated at each step. Algorithms are also provided to ensure the computational tractability of the policy. Furthermore, the safety of the policy is proved, and the global robustness is verified by numerical simulations, which show that the proposed policy reduces the worst-case scheduling cost by 13.1% compared with heuristic policies.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Minimax Framework for Two-Agent Scheduling With Inertial Constraints


    Contributors:
    Yang, Feihong (author) / Shen, Yuan (author)

    Published in:

    Publication date :

    2022-12-01


    Size :

    4375866 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Minimax studies

    Glasser, W. A. / Graham, K. D. / Harvey, C. A. | TIBKAT | 1966



    Epipolar Constraints for Vision-Aided Inertial Navigation

    Diel, David D. / DeBitetto, Paul / Teller, Seth | IEEE | 2005


    Minimax Reinforcement Learning

    Chakravorty, Suman / Hyland, David | AIAA | 2003