Till Örebro universitet

oru.seÖrebro universitets publikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Robots that help each other: self-configuration of eistributed robot systems
Örebro universitet, Akademin för naturvetenskap och teknik. (AASS)
2009 (Engelska)Doktorsavhandling, monografi (Övrigt vetenskapligt)
Abstract [en]

Imagine the following situation. You give your favorite robot, named Pippi, the task to fetch a heavy parcel that just arrived at your front door. While pushing the parcel back to you, she must travel through a door. Unfortunately, the parcel she is pushing is blocking her camera, giving her a hard time to see the door. If she cannot see the door, she cannot safely push the parcel through it.

What would you as a human do in a similar situation? Most probably you would ask someone for help, someone to guide you through the door, as we ask for help when we need to park our car in a tight parking spot. Why not let the robots do the same? Why not let robots help each other? Luckily for Pippi, there is another robot, named Emil, vacuum cleaning the floor in the same room. Since Emil has a video camera and can view both Pippi and the door at the same time, he can estimate Pippi's position relative to the door and use this information to guide Pippi through the door by wireless communication. In that way he can enable Pippi to deliver the parcel to you. The goal of this thesis is to endow robots with the ability to help each other in a similar way.

More specifically, we consider distributed robot systems in which: (1) each robot includes modular functionalities for sensing, acting and/or processing; and (2) robots can help each other by offering those functionalities. A functional configuration of such a system is any way to allocate and connect functionalities configuration among the robots. An interesting feature of a system of this type is the possibility to use different functional configurations to make the same set of robots perform different tasks, or to perform the same task under different conditions. In the above example, Emil is offering a perceptual functionality to Pippi. In a different situation, Emil could offer his motion functionality to help Pippi push a heavier parcel.

In this thesis, we propose an approach to automatically generate, at run time, a functional configuration of a distributed robot system to perform a given task in a given environment, and to dynamically change this configuration in response to failures. Our approach is based on artificial intelligence planning techniques, and it is provably sound, complete and optimal.

In order to handle tasks that require more than one step (i.e., one configuration) to be accomplished, we also show how methods for automatic configuration can be integrated with methods for task planning to produce a complete plan were each step is a configuration. For the scenario above, generating a complete plan before the execution starts enables Pippi to know before hand if she will be able to get the parcel or not. We also propose an approach to merge configurations, which enables concurrent execution of configurations, thus reducing execution time.

We demonstrate the applicability of our approach on a specific type of distributed robot system, called Peis-Ecology, and show experiments in which configurations and sequences of configurations are automatically generated and executed on real robots. Further, we give an experiment where merged configurations are created and executed on simulated robots.

Ort, förlag, år, upplaga, sidor
Örebro: Örebro universitet , 2009. , s. 205
Serie
Örebro Studies in Technology, ISSN 1650-8580 ; 33
Nyckelord [en]
cooperative robotics, distributed robot systems, self-configuration, task planning
Nationell ämneskategori
Datavetenskap (datalogi)
Forskningsämne
Data- och systemvetenskap
Identifikatorer
URN: urn:nbn:se:oru:diva-6528ISBN: 978-91-7668-666-9 (tryckt)OAI: oai:DiVA.org:oru-6528DiVA, id: diva2:214200
Disputation
2009-05-29, Hörsal T, Örebro universitet, Örebro, 13:00 (Engelska)
Opponent
Handledare
Tillgänglig från: 2009-05-04 Skapad: 2009-05-04 Senast uppdaterad: 2018-01-13Bibliografiskt granskad

Open Access i DiVA

fulltext(4962 kB)2290 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 4962 kBChecksumma SHA-512
e30d52f953055131f519ce59b4916410f7f3361b64d6287be8c7a9c0eb161710089da500b61de28482dce09682c5e0c6e17bab05982e1f1451fe16f1e881b260
Typ fulltextMimetyp application/pdf
omslag(1765 kB)432 nedladdningar
Filinformation
Filnamn COVER01.pdfFilstorlek 1765 kBChecksumma SHA-512
226df2cb4ad22ea53314bf262bebf9b4317c0e9d5b445e70002812d6867283f1faeeb225e1f03fe5e90951324da75b048a56aa8a3fd3b2840086a10bbc031b47
Typ coverMimetyp application/pdf

Person

Lundh, Robert

Sök vidare i DiVA

Av författaren/redaktören
Lundh, Robert
Av organisationen
Akademin för naturvetenskap och teknik
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 2298 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

isbn
urn-nbn

Altmetricpoäng

isbn
urn-nbn
Totalt: 1527 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf