Research Article  Open Access
Boolean NetworksBased Auction Algorithm for Task Assignment of Multiple UAVs
Abstract
This paper presents an application of Boolean networksbased auction algorithm (BNAA) for task assignment in unmanned aerial vehicles (UAVs) systems. Under reasonable assumptions, the assignment framework consists of mission control system, communication network, and ground control station. As the improved algorithm of consensusbased bundle algorithm (CBBA), the BNAA utilizes a clusterbased combinatorial auction policy to handle multiple tasks. Instead of empirical method based on lookup table about conditional variables, Boolean network is introduced into consensus routine of BNAA for solving the conflict of assignment across the fleet of UAVs. As a new mathematic theory, semitensor product provides the implementation and theoretical proof of Boolean networks. Numerical results demonstrate the effectiveness and efficiency of proposed BNAA method.
1. Introduction
In the last decade, the unmanned aerial vehicles (UAVs) are developed into collaborative applications [1], such as search and destroy mission, persistent surveillance, border or perimeter patrol [2], and tracking and rescue mission [3]. These demanding applications call for an increasing level of autonomy for each one of the UAVs fleet, which must adapt to changes in situational awareness at real time [4]. As the number of UAVs and missions grows, the task assignment (TA) algorithms are considered to be NPhard problem [5]. In recent works, this challenging problem is solved by many approaches, which include three main types of TA algorithms: centralized, decentralized, and auction algorithms [6].
Using central planner to communicate the central server that produces the plan for the fleet, centralized algorithm tends to yield a better solution than other approaches. However, in this architecture each UAV must consistently communicate with a fixed station, which greatly limits the scope of tasks that the fleet can execute. Moreover, in the mission, the centralized algorithm is subject to a single point failure [7]. Some decentralized approaches [8, 9] are proposed to eliminate above disadvantages. In order to achieve a conflictfree assignment, each UAV of the fleet must perform the same functionality as the central planner of centralized algorithm. For sharing the information of TA, it is generally assumed that the decentralized methods have the infinite bandwidth of communication. Thus, this approach may lead to an inefficient situation, where the member of the fleet will transfer a number of unnecessary data to each other. If that is not the case, although it can improve this inefficiency by introducing the consensus algorithm, decentralized approaches often require severe latency time to communicate [10]. More recently, auction algorithms based on market mechanism for TA are developed. It is effective for producing nearoptimal solutions. After providing bids for match tasks, the UAV with highest value obtains corresponding assignment. To receive these bids and determine the highest value list, the traditional auction method utilizes an auctioneer as the central auction system [11]. Thus, these types of methods suffer the limitations of network topology since the UAV must communicate with the auctioneer for bid on the assignment. Even if the improved method removes the central system, it has been demonstrated that this method still has communication problems.
As an improved auction algorithm, the consensusbased bundle algorithm (CBBA) is developed by combining the bundle method with the consensus approach. Many extended algorithms of CBBA demonstrate its advantage in TA field [6, 12–15]. According to the main components, there are two phases of CBBA. The bundle phase is utilized to the situation, where UAV will bid on multiple tasks for the improvement of the assignment efficiency. In addition, the consensus phase is addressed to solve the conflict of assignment between the UAVs. The consensus algorithm of CBBA achieves by lookup table approach. It is essentially empirical method, although the original and extended CBBA methods can achieve the convergence to conflictfree assignment [14–16]. This manner cannot reveal the logical relation between the information vectors and decision actions.
Considering the efficiency of the computation and communication, this paper presents a Boolean networksbased auction algorithm (BNAA). As similar structure of CBBA, there are two phases for BNAA: combinatorial auction and Boolean networksbased consensus. In the first phase, the cluster method is utilized to assign the task combination with higher value first. Under this policy, the UAV tends to carry out the tasks in the same area instead of single task with lower value outside this area. As the first phase has dealt with the combinatorial assignment, the second phase of BNAA is in charge to handle the conflicts of assignment. In this process, the Boolean networks method is introduced to model the consensus algorithm of lookup table about conditional variables. As a new way to realize the TA, Boolean networks can transfer conditional statements to mathematical theory based on new matrix product, namely, semitensor product [17]. Then, the Boolean network can be converted into an algebraic function, which is described via transition matrix [18]. Therefore, the consensus becomes the process of identification to the related matrices. In the framework of semitensor product approach, the realization, controllability, observability, and disturbance decoupling of Boolean networks are also investigated in many papers [19–22].
The rest of this paper is organized as follows. Section 2 gives some preliminaries. Section 3 formulates the problem of TA for UAVs and provides the architecture of proposed method. In Section 4, the BNAA is discussed in detail. In Section 5, general scenarios present the performance of the BNAA through simulations results and Section 6 follows by some concluding remarks.
2. Preliminaries: Semitensor Product
As a new matrix product tool, semitensor product can convert a logical relation into an algebraic expression. By using this tool, the logical dynamics of a Boolean network can be transformed into discretetime systems [22].
Definition 1. There are and , where denotes the least common multiple of and . Then the semitensor product of with is defined aswhere “” is the Kronecker product. If , then the semitensor product is the regular product of matrix. Thus, “” will be omitted in this paper.
First, we introduce some notations [19].(i) is called logical function.(ii) denotes the th column of the identity matrix . Particularly, , .(iii).(iv)If , then is called a logical matrix. It is briefly denoted asParticularly, if , then , . The binary number can be converted into a hexadecimal number as follows:
To utilize the matrix expression, we identify and . Then the logical variable will be called vectorlogical variable. The logical function can be converted into a mapping . There is an important theorem, which is given by Theorem in [20].
Theorem 2. Let be a logical function, which is converted into vectorlogical form . Then there is a unique logical matrix , which is called the structure matrix of , such that
3. Task Assignment: Problem Statement
3.1. Task Assignment Architecture
In order to illustrate the function of TA, the integrated UAVs system is shown in Figure 1. The assignment architecture of UAVs addresses an integrated cooperating platform with the ability to perform the task assignment adhering to a mission control systems (MCS), for running collaborative and assignment algorithm. In this architecture, ground control station (GCS) is in charge of sending the instructions about takingoff and landing, loading the initial information about the mission and receiving the data from the sensors of UAVs. Each UAV’s MCS runs assignment algorithm and achieves the consensus of TA through the wireless communication network.
3.2. Task Assignment Scenario
Figure 2 illustrates the scenario of tasks assignment for UAVs. Let and be defined as the index sets for the UAVs and tasks, respectively. In this case, represents the th UAV and , the th task. The general consideration is that one task is assigned to no more than one UAV, that is, conflictfree assignment. The global objective function [6] of TA is given bywhere score is obtained by after receiving the assignment of . indicates if is assigned to ; is maximum number of tasks that can take; and represents a vector of assignment for . The solution of the TA depends heavily on the high accuracy model of score function. In the BNAA method, score function consists of a task reward and executing cost [1]. is expressed aswhere is execution time; denotes a static score of ; and are weighting factor. is constraint factor, which is defined aswhere denotes constraint of fuel level that can be provided to perform the rest distance , which must be greater than remaining distance of flight path ; is the constraint about suitability of to ; denotes the constraint of the execution time, where and describe the start time and end time of , respectively; represents the validity of , where is the duration in which the task must be performed.
4. BNAA for Task Assignment
The BNAA method is developed to assignment, in which each UAV will bid on a sequence of multiple tasks by introducing the combinatorial auction algorithm. The Boolean networksbased consensus algorithm is applied for dealing with the conflict of TA in the fleet. Each UAV stores its own information and updates it in continuous loops with these two phases. There are some vectors of information that must carry in the BNAA method [13]:(1)A matrix of tasks information with vector , in which all elements belong to .(2)A highest bid list , where each element represents the highest bid on according to the information of .(3)A creation time list of highest bid , where is the corresponding creation time of the element in .(4)A winner list , in which element is the index of the UAV that wins according to the information of .(5)A combinatorial tasks list , where for , represents the number of multiple tasks that has won. The elements of are ordered according to the adding time of the tasks.(6)An execution sequence list , where indicates the order will perform the task in its combinatorial tasks list, which has the same tasks as .(7)A time list of execution , in which is the corresponding time when will perform the task in .
4.1. Combinatorial Auction
As shown in Figure 3, combinatorial auction process of BNAA is performed by using cluster algorithm [23], where all tasks are taken into account at each time step. Thus, the task combination with higher score has the priority to be assigned. The cluster algorithm has the following steps.
(1) Computation of Distance between Classes. As each task is a class and assuming , denotes the th class, and the distance matrix between classes is given bywhere represents the distance between and .
(2) Modification of Task Score Function. Given upper limit of the distance, if the minimum element in besides 0 is , and are merged into a single class. For , the score of is thereby modified aswhere is weighting factor.
(3) Update of Distance Matrix. According to modified information, the matrix is updated to . Steps to are repeated until .
The local objective function [6] of is defined aswhich represents the sum of the rewards that received by performing the tasks along . The marginal score function about combinatorial tasks [13], that is, the improvement of the objective function when is added, is given bywhere , the symbol is the operator that provides new set after the th element of the , and indicates to add the elements at the end of first list. and update as the following equation:wherewhere if and 0 otherwise.
4.2. Boolean NetworksBased Consensus
The consensus algorithm of lookup table about conditional variables is an effective approach to perform the consistent TA, however, this algorithm is an empirical method, which is hard to demonstrate by theoretical proof. In this work, the conditional variables are transferred to Boolean logic variables, which are the elements of the Boolean network. Using the semitensor product theory, the Boolean network can be converted into an algebraic function.
The BNAA consensus is shown in Table 1, which lists the decision rules of according to received information from . There are three actions the UAV can choose from:(1)Update: The updates its information about highest bid list and winner list .(2)Reset: The will reset its and .(3)Drop (default action): When receives the useless data its information will remain the same.

The Boolean network is the core of the consensus algorithm for BNAA. As shown in Table 2, after the conversion of the conditional variables into logical relation, the Boolean network that can be controlled and analyzed by semitensor product approach is established. According to its own information and received information from about , chooses one action from the decision set . The conversion process of variables is shown in Figure 4.
(a)  
 
(b)  
 
(c)  
 
(d)  
 
(e)  
 
(f)  
 
(g)  

The dynamics of a Boolean control network is expressed as follows [22]:where denotes logical variables; , and , are the logical functions; , means the controls; indicates the outputs.
A Boolean network can be briefly defined by the fivetuple aswhere denotes the state variable vector, is the output vector, denotes the control input vector, is the state transition logical function, and is the output logical function. The dynamics of Boolean network can be formulated as
By the argument as for Theorem 2, if , , and , then these equations can be converted into the vectorlogical expression, which is given by
According to the logical relation of the variables in this work, the vector variables can be described as follows:
Solving (17), the structure matrixes can be received as
In many decision systems, the conditional statements can get very complicated, which makes the algorithm difficult to achieve and maintain. On the other hand, the consensus algorithm based on Boolean network by semitensor product theory has important theoretical significance.
5. Simulation
The CBBA and the extended algorithms have demonstrated its advantage in TA and achieved the convergence to conflictfree assignment [12–16]. In addition, the demonstration for mathematical features of Boolean network using semitensor product theory is addressed in many papers [17, 19–22]. Over the mathematical proof, this paper presents a typical scenario and simulation results.
To verify the efficiency of proposed method, the simulation is tested in MATLAB environment on a PC with Intel Pentium DualCore CPU E5800 3.2 GHz and 4 GB RAM. In the 10 km × 10 km mission scenario, there are 5 UAVs to perform tasks. All UAVs fly at constant velocity of 200 m/s. Experiments are carried out by randomly setting the locations of tasks. Figure 5 compares the performance of CBBA and BNAA. The axis shows the number of tasks, while the axis highlights the objective function of each method. The comparison result demonstrates that BNAA can achieve better assignment than CBBA does. Furthermore, Figure 6 gives a simulation result of BNAA in a specific scenario with 10 tasks.
For a given 5 UAVs, the performance in terms of the time that onestep communication consumed in simulation by varying the number of tasks is shown in Figure 7. Since the Boolean network only involves logical operations, the average time of a communication of BNAA is reduced by 23% compared to CBBA, which utilizes the lookup table to make decision.
6. Conclusion
This paper presents a new way to implement the consensus algorithm of TA for UAVs, which improves theoretical significance and practical value to the development of decision system based on conditional statements. The vector logical expression, transferred from Boolean network by semitensor product theory, is a connection between conditional statements and mathematical theory. The reason to extend our work based on CBBA is because it is the original algorithm of this series. To strengthen the theoretical effectiveness of consensus algorithm in TA, the BNAA begins with the typically valuable reference for broaching this subject.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Acknowledgments
The authors wish to thank the reviewers, the editor, and Dr. Yanfang Liu for many suggestions that substantially improved the quality of this paper.
References
 T. Bakker and R. H. Klenke, “Dynamic multitask allocation for collaborative unmanned aircraft systems,” in Proceedings of the 52nd Aerospace Sciences Meeting, AIAA SciTech, National Harbor, Md, USA, January 2014. View at: Publisher Site  Google Scholar
 K. Kalyanam, P. Chandler, M. Pachter, and S. Darbha, “Optimization of perimeter patrol operations using unmanned aerial vehicles,” Journal of Guidance, Control, and Dynamics, vol. 35, no. 2, pp. 434–441, 2012. View at: Publisher Site  Google Scholar
 V. Shaferman and T. Shima, “Unmanned aerial vehicles cooperative tracking of moving ground target in urban environments,” Journal of Guidance, Control, and Dynamics, vol. 31, no. 5, pp. 1360–1371, 2008. View at: Publisher Site  Google Scholar
 D. Kingston, R. W. Beard, and R. S. Holt, “Decentralized perimeter surveillance using a team of UAVs,” IEEE Transactions on Robotics, vol. 24, no. 6, pp. 1394–1404, 2008. View at: Publisher Site  Google Scholar
 P. B. Sujit and R. Beard, “Multiple MAV task allocation using distributed auctions,” in Proceedings of the AIAA Guidance, Navigation and Control Conference and Exhibit, pp. 1533–1551, August 2007. View at: Google Scholar
 H.L. Choi, L. Brunet, and J. P. How, “Consensusbased decentralized auctions for robust task allocation,” IEEE Transactions on Robotics, vol. 25, no. 4, pp. 912–926, 2009. View at: Publisher Site  Google Scholar
 T. W. McLain and R. W. Beard, “Coordination variables, coordination functions, and cooperativetiming missions,” Journal of Guidance, Control, and Dynamics, vol. 28, no. 1, pp. 150–161, 2005. View at: Publisher Site  Google Scholar
 R. W. Beard, T. W. McLain, D. B. Nelson, D. Kingston, and D. Johanson, “Decentralized cooperative aerial surveillance using fixedwing miniature UAVs,” Proceedings of the IEEE, vol. 94, no. 7, pp. 1306–1324, 2006. View at: Publisher Site  Google Scholar
 M. Alighanbari and J. P. How, “Robust decentralized task assignment for cooperative UAVs,” in Proceedings of the AIAA Guidance, Navigation and Control Conference and Exhibit, August 2006. View at: Google Scholar
 S. Hunt, Q. G. Meng, C. Hinde, and T. Huang, “A consensusbased grouping algorithm for multiagent cooperative task allocation with complex requirements,” Cognitive Computation, vol. 6, no. 3, pp. 338–350, 2014. View at: Publisher Site  Google Scholar
 A. M. Kwasnica, J. O. Ledyard, D. Porter, and C. DeMartini, “A new and improved design for multiobject iterative auctions,” Management Science, vol. 51, no. 3, pp. 419–434, 2005. View at: Publisher Site  Google Scholar
 L. B. Johnson, S. Ponda, and H. Choi, “Improving the efficiency of a decentralized tasking algorithm for UAV teams with asynchronous communications,” in Proceedings of the AIAA Guidance, Navigation, and Control Conference (GNC '10), Toronto, Canada, August 2010. View at: Google Scholar
 L. B. Johnson, S. S. Ponda, H.L. Choi, and J. P. How, “Asynchronous decentralized task allocation for dynamic environments,” in Proceedings of the AIAA InfoTech@ at Aerospace Conference and Exhibit, March 2011. View at: Google Scholar
 T. Mercker, D. W. Casbeer, P. T. Millet, and M. R. Akella, “An extension of consensusbased auction algorithms for decentralized, timeconstrained task assignment,” in Proceedings of the IEEE American Control Conference (ACC '10), pp. 6324–6329, IEEE, Baltimore, Md, USA, July 2010. View at: Google Scholar
 M. Argyle, D. W. Casbeer, and R. Beard, “A multiteam extension of the consensusbased bundle algorithm,” in Proceedings of the American Control Conference (ACC '11), pp. 5376–5381, IEEE, July 2011. View at: Google Scholar
 S. S. Ponda, L. B. Johnson, A. N. Kopeikin, H.L. Choi, and J. P. How, “Distributed planning strategies to ensure network connectivity for dynamic heterogeneous teams,” IEEE Journal on Selected Areas in Communications, vol. 30, no. 5, pp. 861–869, 2012. View at: Publisher Site  Google Scholar
 D. Z. Cheng, Z. Q. Li, and H. S. Qi, “Realization of Boolean control networks,” Automatica, vol. 46, no. 1, pp. 62–69, 2010. View at: Publisher Site  Google Scholar  MathSciNet
 Y. Yan, Z. Chen, and Z. Liu, “Solving type2 fuzzy relation equations via semitensor product of matrices,” Control Theory and Technology, vol. 12, no. 2, pp. 173–186, 2014. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 D. Z. Cheng, “Disturbance decoupling of Boolean control networks,” IEEE Transactions on Automatic Control, vol. 56, no. 1, pp. 2–10, 2011. View at: Publisher Site  Google Scholar  MathSciNet
 D. Z. Cheng, “On finite potential games,” Automatica, vol. 50, no. 7, pp. 1793–1801, 2014. View at: Publisher Site  Google Scholar  MathSciNet
 Y. Zhao and D. Z. Cheng, “On controllability and stabilizability of probabilistic Boolean control networks,” Science China Information Sciences, vol. 57, no. 1, pp. 1–14, 2014. View at: Publisher Site  Google Scholar  MathSciNet
 D. Z. Cheng, H. S. Qi, and Y. Zhao, An Introduction to SemiTensor Product of Matrices and Its Applications, World Scientific Publishing, 2012. View at: Publisher Site  MathSciNet
 W. Pedrycz and H. Izakian, “Clustercentric fuzzy modeling,” IEEE Transactions on Fuzzy Systems, vol. 22, no. 6, pp. 1585–1597, 2014. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2015 Xiaolei Sun et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.