Solving MultiAgent Pathfinding Problems on Graphs in Polynomial Time: A deterministic approach to solving multiagent pathfindi,Used

Solving MultiAgent Pathfinding Problems on Graphs in Polynomial Time: A deterministic approach to solving multiagent pathfindi,Used

In Stock
SKU: DADAX3659200778
Brand: LAP Lambert Academic Publishing
Condition: New
Regular price$77.22
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 1–3 business days
  • Estimated Delivery: 3–5 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
  • Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

Multiagent pathfinding problems involve finding plans for agents that must travel from their start locations to their targets without colliding. Recent work produced a number of algorithms to solve the problem as well as an ample supply of related theory. Most existing works, however, were either too inefficient for practical use or had very restrictive conditions. This work proposes a novel approach to solving Multiagent pathfinding problems, based on tree decompositions, called Treebased Agent Swapping Strategy (TASS). Using TASS we can guarantee that a problem will be solved in polynomial time if it meets a few weak conditions. The overall strategy decomposes graphs into trees, where subproblems can be solved efficiently, and then a solution on the original graph is extracted. Experimental results showed that TASS can find solutions to multiagent pathfinding problems on a highly crowded tree with 1000 nodes and 996 agents in less than 3 seconds. Further experiments compared TASS with other modern contending algorithms and the results were very favorable.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed