백승민, 문성원, Hyun Jin Kim
Abstract
This paper describes a task assignment problem for heterogeneous multi-agent systems, Optimal task assignment for multi-agent is solved by mixed integer linear programming (MILP), where decision-making variables can be represented using binary conditions.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper describes a task assignment problem for heterogeneous multi-agent systems, Optimal task assignment for multi-agent is solved by mixed integer linear programming (MILP), where decision-making variables can be represented using binary conditions.
Key concepts: Task (project management), Weapon target assignment problem, Integer programming, Computer science, Mathematical optimization, Linear programming, Generalized assignment problem, Assignment problem