Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Cooperative Motion and Task Planning Under Temporal Tasks
KTH, School of Electrical Engineering (EES), Automatic Control.ORCID iD: 0000-0003-4562-854X
2014 (English)Licentiate thesis, monograph (Other academic)
Abstract [en]

Temporal-logic-based languages provide a formal and accurate way to specify complex motion and action missions for autonomous robots, beyond the classic point-to-point navigation task. The first part of the thesis is devoted to the nominal scenario: an autonomous robot is given a motion task specified as Linear-time Temporal Logic (LTL) formulas. Under the assumption that the workspace is static and fully-known, we provide a systematic and automated scheme to synthesize both the discrete motion and task plan and the hybrid control strategy that drives the robot, such that the resulting trajectory fulfills the given task specification. Limited knowledge about the workspace model, unforeseen changes in the workspace property and un-modeled dynamical constraints of the robot may render the nominal approach inadequate. Thus in the second part of the thesis we take into account four non-nominal scenarios where: (i) the specified task is not feasible; (ii) the task contains hard and soft constraints; (iii) the workspace model is not fully-known in priori; (iv) the task involves not only robot motion but also actions. The proposed results greatly improve the real-time adaptability and reconfigurability of the nominal scheme. In the last part, we analyze a team of interconnected autonomous robots with local and independently-assigned tasks. Firstly we consider the case where cooperations among the robots are imposed due to heterogeneity and collaborative tasks. A decentralized coordination scheme is proposed such that the robots' joined plans satisfy their mutual tasks the most. Then a distributed knowledge transfer and update procedure is designed for the networked robots that co-exist within a common but partially-known workspace. It guarantees both the safety and correctness of their individual plans.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2014. , viii, 104 p.
Series
TRITA-EE, ISSN 1653-5146 ; 2014:005
National Category
Engineering and Technology
Research subject
Electrical Engineering
Identifiers
URN: urn:nbn:se:kth:diva-141803ISBN: 978-91-7595-016-7 (print)OAI: oai:DiVA.org:kth-141803DiVA: diva2:698738
Presentation
2014-03-13, L1, Drottning Kristinasväg 30, KTH, Stockholm, 10:15 (English)
Opponent
Supervisors
Projects
EU RECONFIG
Note

QC 20140225

Available from: 2014-02-25 Created: 2014-02-25 Last updated: 2014-02-25Bibliographically approved

Open Access in DiVA

Thesis(6762 kB)423 downloads
File information
File name FULLTEXT01.pdfFile size 6762 kBChecksum SHA-512
ecbb33f5b182e79f8d0bb04f9c45e404510378d2dd8ff6bd54d019e7685e970b21af3d3fb973058112d8dab193f4ad08c79ac9e0b94ee2e560a7a23c6a9c3314
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Guo, Meng
By organisation
Automatic Control
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 423 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 883 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf