A Guide to Budgeted Tree Search Nathan R. Sturtevant University of - PowerPoint PPT Presentation

Nodes and f -costs • Exponential Search: • Find value in unbounded sorted array • Tree Search: • Find ( node expansions ) in ( f-costs ) • Nodes expansions non-decreasing with f -cost A Guide to Budgeted Tree Search 21

How does BTS work? If the nodes in each iteration do not grow exponentially

Budgeted search • Like exponential search on f-costs A Guide to Budgeted Tree Search 23

Budgeted search • Like exponential search on f-costs f = ∞ f = 10 A Guide to Budgeted Tree Search 23

Budgeted search • Like exponential search on f-costs f = 27.2 (2 × ) f = 30.7 (8 × ) f = ∞ f = 10 A Guide to Budgeted Tree Search 23

Budgeted search • Like exponential search on f-costs f = 27.2 (2 × ) f = 30.7 (8 × ) f = ∞ f = 10 n i = 100 A Guide to Budgeted Tree Search 23

Budgeted search • Like exponential search on f-costs f = 27.2 (2 × ) f = 30.7 (8 × ) f = ∞ f = 10 n i = 100 200 A Guide to Budgeted Tree Search 23

Budgeted search • Like exponential search on f-costs f = 27.2 (2 × ) f = 30.7 (8 × ) f = ∞ f = 10 n i = 100 200 800 A Guide to Budgeted Tree Search 23

Budgeted search • Like exponential search on f-costs f = 27.2 (2 × ) f = 30.7 (8 × ) f = ∞ f = 10 < 200 n i = 100 200 800 A Guide to Budgeted Tree Search 23

Budgeted search • Like exponential search on f-costs f = 27.2 (2 × ) f = 30.7 (8 × ) f = ∞ f = 10 < 200 ≥ 800 n i = 100 200 800 A Guide to Budgeted Tree Search 23

Budgeted search • Like exponential search on f-costs f = 27.2 (2 × ) f = 30.7 (8 × ) f = ∞ f = 10 < 200 ≥ 800 n i = 100 200 800 Budget: Stop when exceeded A Guide to Budgeted Tree Search 23

Budgeted search • Like exponential search on f-costs f = 27.2 (2 × ) f = 30.7 (8 × ) f = ∞ f = 10 < 200 ≥ 800 n i = 100 200 800 Budget: Stop when exceeded A Guide to Budgeted Tree Search 23

Budgeted search • Like exponential search on f-costs A Guide to Budgeted Tree Search 24

Budgeted search • Like exponential search on f-costs f = 10 A Guide to Budgeted Tree Search 24

Budgeted search • Like exponential search on f-costs f = 10 A Guide to Budgeted Tree Search 24

Budgeted search • Like exponential search on f-costs f = ∞ f = 10 A Guide to Budgeted Tree Search 24

Budgeted search • Like exponential search on f-costs f = 27.2 (2 × ) f = 30.7 (8 × ) f = ∞ f = 10 A Guide to Budgeted Tree Search 24

Budgeted search • Like exponential search on f-costs f = 27.2 (2 × ) f = 30.7 (8 × ) f = ∞ f = 10 11 < A Guide to Budgeted Tree Search 24

Budgeted search • Like exponential search on f-costs f = 27.2 (2 × ) f = 30.7 (8 × ) f = ∞ f = 10 11 12 < < A Guide to Budgeted Tree Search 24

Budgeted search • Like exponential search on f-costs f = 27.2 (2 × ) f = 30.7 (8 × ) f = ∞ f = 10 14 11 12 < < < A Guide to Budgeted Tree Search 24

Budgeted search • Like exponential search on f-costs f = 27.2 (2 × ) f = 30.7 (8 × ) f = ∞ f = 10 14 11 12 18 < < < < A Guide to Budgeted Tree Search 24

Budgeted search • Like exponential search on f-costs f = 27.2 (2 × ) f = 30.7 (8 × ) f = ∞ f = 10 14 11 12 18 26 < < < < < A Guide to Budgeted Tree Search 24

Budgeted search • Like exponential search on f-costs f = 27.2 (2 × ) f = 30.7 (8 × ) f = ∞ f = 10 14 11 12 18 26 42 < < < < < > A Guide to Budgeted Tree Search 24

Budgeted search • Like exponential search on f-costs f = 27.2 (2 × ) f = 30.7 (8 × ) f = ∞ f = 10 14 34 11 12 18 26 42 < < < > < < > A Guide to Budgeted Tree Search 24