SlideServe
Télécharger Obtenir Pro
Menu
Accueil Pro
Préférences
ApparenceLight Aide et commentaires
© SlideServe · v2026

The MPAS project Multi-agent Pathfinding Algorithms Simulator

foy avatar
foy
26 diapositives · 484 Views · Sep 14, 2014

Application Design Document - ADD Technical Advisor : Mr. Roni Stern Academic Advisor : Dr. Meir Kalech Team members : Amit Ofer Liron Katav Project Homepage : http://mpasproject.weebly.com. The MPAS project Multi-agent Pathfinding Algorithms Simulator.

#the mpas project multi-agent pathfinding algorithms simulator #the mpas project multi-agent pathfinding algorithms simulator ppt #powerpoint #presentation
The MPAS project Multi-agent Pathfinding Algorithms Simulator - slide 1
01 / 26The MPAS project Multi-agent Pathfinding Algorithms Simulator
1 / 17

Télécharger la présentation

The MPAS project Multi-agent Pathfinding Algorithms Simulator
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation

  1. Application Design Document - ADD Technical Advisor : Mr. Roni Stern Academic Advisor : Dr. Meir Kalech Team members : AmitOfer LironKatav Project Homepage : http://mpasproject.weebly.com The MPAS project Multi-agent Pathfinding Algorithms Simulator

  2. Reminder : project’s goal • Our Project’s goal is to develop a simulator that will help to observe the different behaviors and compare the performance of various multi-agent pathfinding algorithms. • The algorithms we will implement: • A* - MultiAgent Version. • Cooperative A* , Silver • Hierarchical Cooperative A* (HCA*) , Silver, D. • Cooperative PathFinding (ID + OD) , Trevor.

  3. Use cases – Grid maps

  4. Use cases – Geographical maps

  5. System architecture User Gestures State Change ControllerLayer View Changes Input • Graphical User Interface(GUI) Layer • Algorithm Layer -Method Invocation -Events

  6. Class diagram

  7. Class diagram (cont’)

  8. Graphical User Interface

  9. Overview of the user interface

  10. Change the size of the grid

  11. Generate random agent’s positions

  12. Change number of agents

  13. Generate random map

  14. Load/Save maps and sceneries

  15. Finding a path

  16. Changing allowed directions

  17. Running the algorithm in steps

  18. Testing

  19. Non-functional requirements Testing • Speed • we will measure by timer the time it takes to load the application. • In order to test that the system produces output in less than 15 minutes we will wrap the algorithms with timers. • Capacity • We will run the simulation with different *.map files contains up to 100 agents and 100*100 grid size and check they loaded correctly. • Reliability • The system should be able to detect when a corrupted file is loaded and alert the user :we will produce corrupted input files and run the software on them to see if the system alerts the user. • We'll test the system with boundary and illegal inputs. For example - undefined cell on the grid as input for agent position

  20. Non-functional requirements Testing • Usability • We will deliver the prototype of the simulator to the users and examine their time to learn the system. • We'll tests that the use of the system isn't difficult or unclear by letting users to use it. • We will test the user's response to the GUI, and see if the system is comfortable. • Availability • We'll Measure the response time of the system (with a timer).

  21. Functional requirements Testing • We used JUnit in order to test the functional requirements: • Choose the size of the grid map, and the number of agents. • Load grid maps. • Save grid maps. • Clear map. • Sets the starting and finishing cells for each agent. • Set blocking cells. • Choose the algorithm to be tested. • Choose the heuristic to be used. • Start the simulation. • Stop the simulation. • Running the simulation Step by step. • Generate random scenario.

  22. Task list

  23. Uncompleted tasks. • Finish the simulator infrastructure and GUI. • Implement the 2 remaining algorithms. • Add performance measurements. • Add more features. • Add more animation abilities & graphics. • Add geographical map support (if we have enough time) • User manual and other documents.

  24. Time table

  25. Issues on GoogleCode

  26. Thank you for listening The End