SwePub
Sök i LIBRIS databas

  Extended search

id:"swepub:oai:DiVA.org:oru-112201"
 

Search: id:"swepub:oai:DiVA.org:oru-112201" > Planning for Automa...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Planning for Automated Testing of Implicit Constraints in Behavior Trees

Köckemann, Uwe, 1983- (author)
Örebro universitet,Institutionen för naturvetenskap och teknik,AASS
Calisi, Daniele (author)
Magazino GmbH, Munich, Germany
Gemignani, Guglielmo (author)
Magazino GmbH, Munich, Germany
show more...
Renoux, Jennifer, 1989- (author)
Örebro universitet,Institutionen för naturvetenskap och teknik,AASS
Saffiotti, Alessandro, Professor, 1960- (author)
Örebro universitet,Institutionen för naturvetenskap och teknik,AASS
show less...
 (creator_code:org_t)
AAAI Press, 2023
2023
English.
In: Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling. - : AAAI Press. ; , s. 649-658
  • Conference paper (peer-reviewed)
Abstract Subject headings
Close  
  • Behavior Trees (BTs) are a formalism increasingly used to control the execution of robotic systems. The strength of BTs resides in their compact, hierarchical and transparent representation. However, when used in practical applications transparency is often hindered by the introduction of implicit run-time relations between nodes, e.g., because of data dependencies or hardware-related ordering constraints. Manually verifying the correctness of a BT with respect to these hidden relations is a tedious and error-prone task. This paper presents a modular planning-based approach for automatically testing BTs offline at design time, to identify possible executions that may violate given data and ordering constraints and to exhibit traces of these executions to help debugging. Our approach supports both basic and advanced BT node types, e.g., supporting parallel behaviors, and can be extended with other node types as needed. We evaluate our approach on BTs used in a commercially deployed robotics system and on a large set of randomly generated trees showing that our approach scales to realistic sizes of more than 3000 nodes. 

Subject headings

NATURVETENSKAP  -- Data- och informationsvetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences (hsv//eng)

Keyword

Automated Planning
Robotics
Behavior Trees
Computer Science
Datavetenskap

Publication and Content Type

ref (subject category)
kon (subject category)

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Find more in SwePub

By the author/editor
Köckemann, Uwe, ...
Calisi, Daniele
Gemignani, Gugli ...
Renoux, Jennifer ...
Saffiotti, Aless ...
About the subject
NATURAL SCIENCES
NATURAL SCIENCES
and Computer and Inf ...
Articles in the publication
By the university
Örebro University

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view