Scholars Central

ArticlePublished 19 Jan 2025

A replication study of the TA-prioritized algorithm with a modified deadlock avoidance method

Authors: Nicolaas Pieter Cawood

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

This paper proposes a modified deadlock avoidance method for the TAprioritized algorithm. Their algorithms were developed for the offline Multi-Agent Pickup and Delivery (MAPD) problems where a team of agents have delivery tasks with known release times (when the tasks are ready for pickup.) Offline MAPD problems exist in settings such as warehouses and factories where the release times of tasks are known in advance make use of this information to compute a good task sequence for each agent using a Travelling Salesman Problem (TSP) solver. The task sequences are then used to plan agent paths accordingly and the deadlock avoidance method proposed attempts holding the pickup locations (keeping an agent stationed at a vertex) if an agent has reached it before the release time and retrying a 1time step delayed path from the agent’s initial parking location if any of the agent’s tasks’ path finding fails.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Modern and Applied Physics.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Modern and Applied Physics
  • SubjectPhysics & Astronomy
  • BylineArticles whose byline prints “Nicolaas Pieter Cawood”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels