Pith. sign in

REVIEW 1 cited by

Behavior Trees for Robust Task Level Control in Robotic Applications

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2301.06434 v1 pith:IR6KEFTK submitted 2023-01-16 cs.RO

Matteo Iovino , Christian Smith This is my paper · ORCID
classification cs.RO
keywords behaviortreesapplicationsmethodsrobotictaskautomaticallyautonomous
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Behavior Trees are a task switching policy representation that can grant reactiveness and fault tolerance. Moreover, because of their structure and modularity, a variety of methods can be used to generate them automatically. In this short paper we introduce Behavior Trees in the context of robotic applications, with overview of autonomous synthesis methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Community-Aware Temporal Walks: Parameter-Free Representation Learning on Continuous-Time Dynamic Graphs

    cs.LG 2025-01 conditional novelty 5.0 of 10

    CTWalks combines community-guided temporal walks, community-labeled anonymization, and a Neural ODE encoder to improve temporal link prediction on continuous-time dynamic graphs.

Pith tools