2009
DOI: 10.1007/978-3-642-00909-9_31
|View full text |Cite
|
Sign up to set email alerts
|

Autonomous Mobile Robot Emmy III

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 3 publications
0
7
0
Order By: Relevance
“…Robots and AS should be programed with our best normative theories of logic, rationality [46] and ethics tempered with pragmatic performance expectations. Robots and AS are already computational devices, thus abide by propositional logic, predicate logic, and sometimes paraconsistent logic [93]. Robots increasingly make decisions under uncertainty using Bayesian rationality [8,92].…”
Section: What or Who Should We Trust?mentioning
confidence: 99%
“…Robots and AS should be programed with our best normative theories of logic, rationality [46] and ethics tempered with pragmatic performance expectations. Robots and AS are already computational devices, thus abide by propositional logic, predicate logic, and sometimes paraconsistent logic [93]. Robots increasingly make decisions under uncertainty using Bayesian rationality [8,92].…”
Section: What or Who Should We Trust?mentioning
confidence: 99%
“…One of their results, the autonomous robot EMMY III is designed to be able to navigate through dilemmatic situations, for example, when one sensor detects an obstacle in front of the robot, while the other detects the presence of no objects [89].…”
Section: Automated Reasoningmentioning
confidence: 99%
“…Recall the robot EMMY III ( [89]), which uses paraconsistent logic in order to determine its movements. It is based on it that this small example is presented.…”
Section: Roboticsmentioning
confidence: 99%
See 1 more Smart Citation
“…The second category of inconsistency can be checked by the following CTL formula AG(¬(B n 1 +1 ∧ EXD n 1 +1 ) ∧ ¬(D n 1 +1 ∧ EXB n 1 +1 )∧ · · · ∧ ¬(B n ∧ EXD n ) ∧ ¬(D n ∧ EXB n )). (6) or LTL formula…”
Section: Lemmamentioning
confidence: 99%