1 / 84

CoMutaR : An approach for task allocation

Pedro Mitsuo Shiroma Advisor : Mario F. M. Campos Co-advisor: Vijay Kumar. CoMutaR : An approach for task allocation. Motivation. In a near future it is very likely that several robots will be present in the same workspace. Motivation. In this scenario we will have:

meg
Download Presentation

CoMutaR : An approach for task allocation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Pedro Mitsuo Shiroma Advisor: Mario F. M. Campos Co-advisor: Vijay Kumar CoMutaR: An approach for task allocation

  2. Motivation In a near future it is very likely that several robots will be present in the same workspace

  3. Motivation In this scenario we will have: • Robots executing theirs assigned tasks, • with rich sensorial capacity, • high processing power, • and communication devices; • A lot of underutilized resources; • Increasingly large amounts of continuously gathered data;

  4. Problem definition How to effectively allocate the available resources (whole robots, sensors, gathered data, actuators, processing power, etc.) for the successful execution of multiple tasks? or, more formally…

  5. Problem definition Given a set of (possibly) heterogeneous mobile robots located in a dynamical environment and a set of tasks that need to be executed, allocate tasks to one or more robots efficiently.

  6. Task1 Task2 Task3 Task4 ... Taskp Problem definition robot1 robot2 robot3 ... robotm

  7. Outline • Related work • CoMutaR • Experimental results • Conclusion

  8. Outline • Related work • CoMutaR • Experimental results • Conclusion

  9. Related Work: Taxonomy • Tasks • Robots • Assignment [Gerkey 2003]

  10. Related Work: Taxonomy – Tasks • SR – Single-Robot tasks • MR – Multi-Robot tasks robot1 Task1 robot2 Task2 robot3

  11. Related Work: Taxonomy – Assignment • No knowledge • Model-based Task1 Task2 t t0 t1 Task1 t2 Task2 t

  12. Related Work: Taxonomy – Robots • ST – Single-Task Robot • MT – Multi-Task Robot robot1 Task1 robot2 Task2 Task3

  13. Related work

  14. Related work “'Most commonly, task allocation problems assume robots are single-task robots, since more capable robots that perform multiple tasks in parallel are still beyond the current state of the art” Lynne E. Parker, Springer handbook of robotics (2008)

  15. Outline • Related work • CoMutaR • Overview • Action • Share-restricted resource • Constraint functions • Query • Coalition • Experimental results • Conclusion

  16. CoMutaR: Coalition formation based on Multitasking Robots

  17. CoMutaR: Overview • Coalition of actions Obstacle avoidance

  18. open auction open query open query cost cost bid winner connect CoMutaR: Overview • Coalition formation • Protocol (IA) Obstacle avoidance Obstacle avoidance t connect

  19. CoMutaR: Overview • Assumptions • Tasks can be subdivided into actions; • Actions are able to determine or estimate, based on the query, its constraint functions; • If all inputs (queries) and constraint functions are obeyed then the action will successfully perform as expected.

  20. CoMutaR: Nomenclature robot • : the 4th action in robot 3; • : the 2nd share-restricted resource in robot 1 • : the constraint function imposed by over action Share-restricted resource

  21. CoMutaR: Overview

  22. Outline • Related work • CoMutaR • Overview • Action • Share-restricted resource • Constraint functions • Query • Coalition • Experimental results • Conclusion

  23. CoMutaR: Action • An action is any computational module that can either produce data or perform a task robot1 Task1

  24. CoMutaR: Action • Sensor reading: • Data transform: • Task accomplishing: Task

  25. Outline • Related work • CoMutaR • Overview • Action • Share-restricted resource • Constraint functions • Query • Coalition • Experimental results • Conclusion

  26. CoMutaR: Share-restricted resource • MT (Multitasking) robots Task1 robot1 Task2

  27. CoMutaR: Share-restricted resource • A share-restricted resource is any property that cannot be freely shared among actions. • Communication link; • Processing power; • Power supply; • Allowed configuration space;

  28. CoMutaR: Share-restricted resource • Codomain; • Communication link: • Processing power: • Power supply: • Allowed c-space: configuration space

  29. CoMutaR: Share-restricted resource • Maximum capacity: • Communication link: maximum bandwidth; • Processing power: allocated processing time; • Power supply: battery capacity; • Allowed c-space;

  30. CoMutaR: Share-restricted resource – Allowed c-space composition surveillance controller

  31. Outline • Related work • CoMutaR • Overview • Action • Share-restricted resource • Constraint functions • Query • Coalition • Experimental results • Conclusion

  32. CoMutaR: Constraint function ... ... ... ... ... . . . ... ...

  33. CoMutaR: Constraint function • Constraint function: • compound operator: • comparison operator:

  34. CoMutaR: Constraint function – Communication link • codomain: • : required communication bandwidth • : maximum bandwidth • 30Mb/s + 20Mb/s ≤ 100Mb/s

  35. CoMutaR: Constraint function – Processing power • codomain: • : required processing time • : allocated processing power • 10% + 20% ≤ 90%

  36. CoMutaR: Constraint function – Allowed c-space • Allowed c-space Obstacle avoider Non-holonomic constraint composition

  37. CoMutaR: Constraint function – Allowed c-space • Constraints imposed by sensors (queries) Queries are periodically updated

  38. CoMutaR: Constraint function – Allowed c-space • Potential field approaches: • Lower potential: • Allowed • Greater potential: • Not allowed

  39. CoMutaR: Constraint function – Allowed c-space • codomain: • : empty space

  40. Outline • Related work • CoMutaR • Overview • Action • Share-restricted resource • Constraint functions • Query • Coalition • Experimental results • Conclusion

  41. CoMutaR: Query • Information type [Donald1997]: • Resource database [Cowley2004]: • Query:

  42. CoMutaR: Query • Dynamical environments: • Reactive tasks: • Mapping: • User interface:

  43. CoMutaR: Query • Independence of producer and consumer allows fault tolerance: Obstacle avoidance roboti robotj

  44. CoMutaR: Query • An action can execute only if all input queries are answerable; • A query is a contract between producer and consumer, which guarantee data connection; • A query can include other queries: • A surveillance action is taking snapshots: • A pursue action in the same robot is trying to track an intruder:

  45. CoMutaR: Query • An action can intervene on the query of another action: • An obstacle avoidance is querying for obstacles: • A box pushing action can alter the region queried by the obstacle avoidance:

  46. Outline • Related work • CoMutaR • Overview • Action • Share-restricted resource • Constraint functions • Query • Coalition • Experimental results • Conclusion

  47. CoMutaR: Coalition formation protocol action2 action1 Task1 db1 db2 actionn

  48. CoMutaR: Coalition formation protocol

  49. Outline • Related work • CoMutaR • Experimental results • Conclusion

  50. Tightly-coupled tasks – Box pushing • Vleft • vright

More Related