search

UMD    CORE




Fig. 1 from the paper. This is a depiction of the problem, task allocation with very low communication (left). Two example scenarios to which this problem is relevant (right) are task allocation to stealth agents already in the field (right-top) and task allocation when communication is jammed by an adversary (right-bottom). Click for larger view.

Fig. 1 from the paper. This is a depiction of the problem, task allocation with very low communication (left). Two example scenarios to which this problem is relevant (right) are task allocation to stealth agents already in the field (right-top) and task allocation when communication is jammed by an adversary (right-bottom). Click for larger view.

 

A new paper by Clark School faculty, alumni and students explores the problem of task allocation among networked multi-robot systems when communication conditions are poor. It was recently published online in IEEE Access.

Distributed Task Allocation Algorithms for Multi-Agent Systems With Very Low Communication presents two new algorithms designed for situations when robot “agents” choose not to communicate. This may be for reasons of stealth, when there is considerable loss in communication signal over long distances, when hardware malfunctions, or when communication is actively jammed by an adversary. In such cases, agents may need to divide up tasks without knowing the status of other agents.

Giving robots algorithms that can handle these conditions is useful. Assuming that networked agents know the total number of agents in the workspace, the authors developed solutions that ensure all tasks are eventually completed—even if some agents in the network are destroyed. Their two new task allocation algorithms assume communication may not happen, but bene?t the robotic agents and their missions whenever communication is successful.

The work was conducted by ISR alumnus Akshay Bapat (MSSE 2020), now a robotics perception engineer with Magna International in Troy, Mich.; current M.Eng. in Robotics student Bharath Reddy Bora; Professor Jeffrey Herrmann (ME/ISR), Professor Shapour Azarm (ME), Assistant Professor Huan Mumu Xu (AE/ISR), and ISR-affiliated Assistant Professor Michael Otte (AE).

The first algorithm, the “Spatial Division Playbook Algorithm,” (SDPbA), divides tasks among agents based on an area decomposition. The second algorithm, the “Traveling Salesman Playbook Algorithm” (TSPbA), considers mission travel distance by leveraging an existing algorithm, Christo?des’ 3/2 approximation algorithm. Both algorithms are designed to perform better than existing decentralized task allocation algorithms in scenarios with very low communication availability.

In the paper, the authors use simulations to compare the new SDPbA and TSPbA algorithms to four existing state-of-the-art task allocation algorithms (ACBBA, DHBA, PIA and GA) across multiple communication levels and multiple numbers of targets, and using three different communication models. In particular, they consider task allocation scenarios that involve visiting stationary targets, and study how performance changes across a variety of communication quality levels and target numbers, while keeping number of agents constant.

They find that both SDPbA and TSPbA offer trade-offs between using a simple and computationally ef?cient approach and using a more sophisticated but more expensive approach. If the number of targets is small, TSPbA is only slightly computationally more expensive than SDPbA. If there are a large number of targets, TSPbA may generate a better solution but is signi?cantly more computationally expensive than SDPbA. Overall, the new algorithms perform favorably, in terms of the time required to ensure all targets are visited, in the special case when communication is very low.

The authors’ experimental results show that SDPbA and TSPbA perform better on average than current algorithms ACBBA, DHBA, PIA and GA at lower communication levels and at number of targets greater than 30, especially with respect to average mission completion time. TSPbA performs better than SDPbA in all cases except for when the number of targets are 10.

The playbook algorithms performed well in scenarios with very low communication and many targets regardless of communication model. This suggests that the playbook algorithms, and especially TSPbA, may have useful applications in a variety of low-communication settings.



Related Articles:
ArtIAMAS receives third-year funding of up to $15.1M
A cooperative control algorithm for robotic search and rescue
UMD Team Wins Inaugural NIST UAS 3.1: FastFind Challenge
USMSM Debuts SMART Innovation Center
Derek Paley's e-scooter work featured in Washington Post
Rachel Suitor aboard NGS/NOAA expedition in Gulf of Mexico
UMD Takes Second in VFS Design-Build-Vertical-Flight Competition
UMD, UMBC, ARL Announce Cooperative Agreement to Accelerate AI, Autonomy in Complex Environments
Paley receives ONR funding for cross-domain cooperative control
New hazard mitigation software moves UAVs closer to National Airspace System integration

January 19, 2023


«Previous Story  

 

 

Current Headlines

Ph.D. Student Receives Best Paper Award at VFS 80th Annual Forum

Maryland Engineering: Top 10 Among Public Graduate Programs, Six Years Running

Roving Reporter

Students with Entrepreneurial Curiosity: Launch Your Business Idea at Maryland

Congratulations to our 2024 Honors and Awards Recipients

Engineering Students Fabricate Tomorrow’s Solutions Today

Alum Appointed Space Domain Lead for AIAA

UMD Team Advances in NIST UAS 5.0 Competition, Wins Three Best in Class Awards

When Vision Fails, a Suit Could Steer Pilots to Safety

Celebrating Asian, Pacific Islander, and Desi American Engineers

 
 
Back to top  
CORE Home Clark School Home UMD Home Aerospace Engineering