Immunity-Based Dynamic Reconfiguration of Mobile Robots in Unstructured Environments

Raza, Ali; Ali, Shujat; Akram, Maria

doi:10.1007/s10846-019-01000-6

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

2022

Publication Types

Select...

Article4

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, general discussion of the FP has remained largely qualitative (e.g., References [8][9][10][11][12][13][14]; see References [15,16] for recent reviews) and the question of its technical tractability in a realistic, uncircumscribed operational setting remains open. Practical solutions to the FP, particularly in robotics, remain heuristic (e.g., References [17][18][19]).…”

Section: Introductionmentioning

confidence: 99%

Equivalence of the Frame and Halting Problems

Dietrich

Fields

2020

Algorithms

View full text Add to dashboard Cite

The open-domain Frame Problem is the problem of determining what features of an open task environment need to be updated following an action. Here we prove that the open-domain Frame Problem is equivalent to the Halting Problem and is therefore undecidable. We discuss two other open-domain problems closely related to the Frame Problem, the system identification problem and the symbol-grounding problem, and show that they are similarly undecidable. We then reformulate the Frame Problem as a quantum decision problem, and show that it is undecidable by any finite quantum computer.

show abstract