A Dynamic Decision-Maker of Anytime Algorithm for Tasks Decision-Making Problem
Authors:
- Yaozhong ZhangYZYaozhong Zhang
- Lei ZhangLZLei Zhang
- Mohan LiMLMohan Li
- 1 August 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 353-356
Abstract
In this paper, a mathematical model of dynamic task schedule based on an anytime algorithm is proposed. The factors that affect the task deadline of opponents are studied. We construct the mathematical model according to minimize of surplus threat and maximize of attack value. By using the task deadline and time utility the model can give the decisions timely and coordinately for known and unknown targets. Balancing the task deadline and decision efficiency, the model can schedule the decisions quickly. We applied this model to a real-time dynamic weapon-target assignment (DWTA) problem. The simulation results show that the model based on anytime algorithm is timely and efficiently for the DWTA problems.Keywords
This publication has 6 references indexed in Scilit:
- Dynamic Weapon Target Assignment Method Based on Artificial Fish Swarm AlgorithmCommunications in Computer and Information Science, 2012
- An Efficient Rule-Based Constructive Heuristic to Solve Dynamic Weapon-Target Assignment ProblemIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 2010
- Efficient Decision Makings for Dynamic Weapon-Target Assignment by Virtual Permutation and Tabu Search HeuristicsIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 2010
- Evolutionary decision-makings for the dynamic weapon-target assignment problemScience China Information Sciences, 2009
- Anytime algorithms for multiagent decision making using coordination graphs2005
- Monitoring and control of anytime algorithms: A dynamic programming approachArtificial Intelligence, 2001