1998
DOI: 10.1007/bfb0095430
|View full text |Cite
|
Sign up to set email alerts
|

OBDDs in heuristic search

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
41
0

Year Published

2000
2000
2017
2017

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 58 publications
(42 citation statements)
references
References 3 publications
0
41
0
Order By: Relevance
“…for all edges e i j ∈ E such that source vertex is v do 10: u ← target vertex of e i j , β ← followBDD(e i j ,α) 11: if β = ⊥ then continue 12: if label(β) = e i j then 13: β ← hi(β) 14:…”
Section: Bdd-constrained a * Searchmentioning
confidence: 99%
See 1 more Smart Citation
“…for all edges e i j ∈ E such that source vertex is v do 10: u ← target vertex of e i j , β ← followBDD(e i j ,α) 11: if β = ⊥ then continue 12: if label(β) = e i j then 13: β ← hi(β) 14:…”
Section: Bdd-constrained a * Searchmentioning
confidence: 99%
“…The combination of BDD and A * is considered in [14], [15], where BDD is used for improving the efficiency of the search process. BDD here is used for managing the search state of A * .…”
Section: Related Workmentioning
confidence: 99%
“…Cost algebras Cost algebras [38] generalize edge weights to more general cost structures. A cost algebra is defined as A, ×, , 0, 1 , such that A, ×, 1 , is a monoid, is a total order, 0 = ⊓A and 1 = ⊔A, and A is isotone 1 .…”
Section: Concepts and Notationmentioning
confidence: 99%
“…Edelkamp and Reffel [22] developed the first OBDD-based implementation of A* called BDDA*. Currently the diverse research aspects include STRIP planning [23,24], conformant planning [25], planning under partial observability [26], universal planning [27], fault tolerant planning and others [28].…”
Section: Introductionmentioning
confidence: 99%