2013
DOI: 10.1613/jair.4047
|View full text |Cite
|
Sign up to set email alerts
|

Heuristic Search When Time Matters

Abstract: In many applications of shortest-path algorithms, it is impractical to find a provably optimal solution; one can only hope to achieve an appropriate balance between search time and solution cost that respects the user's preferences. Preferences come in many forms; we consider utility functions that linearly trade-off search time and solution cost. Many natural utility functions can be expressed in this form. For example, when solution cost represents the makespan of a plan, equally weighting search time and pl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
27
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 24 publications
(27 citation statements)
references
References 23 publications
0
27
0
Order By: Relevance
“…Following the pioneering work of Simon (1955Simon ( , 1972 on bounded rationality, decision-making with limited information-processing resources has been studied extensively in psychology (Gigerenzer and Todd, 1999;Camerer, 2003;Brighton, 2009), economics (McKelvey andPalfrey, 1995;Rubinstein, 1998;Kahneman, 2003;Parkes and Wellman, 2015), political science (Jones, 2003), industrial organization (Spiegler, 2011), cognitive science (Howes et al, 2009;Janssen et al, 2011), computer science, and artificial intelligence research (Horvitz, 1988;Lipman, 1995;Russell, 1995;Russell and Subramanian, 1995;Russell and Norvig, 2002;Lewis et al, 2014). Conceptually, the approaches differ widely ranging from heuristics (Tversky and Kahneman, 1974;Gigerenzer and Todd, 1999;Gigerenzer and Brighton, 2009;Burns et al, 2013) to approximate statistical inference schemes (Levy et al, 2009;Vul et al, 2009Vul et al, , 2014Sanborn et al, 2010;Tenenbaum et al, 2011;Fox and Roberts, 2012;Lieder et al, 2012).…”
Section: Introductionmentioning
confidence: 99%
“…Following the pioneering work of Simon (1955Simon ( , 1972 on bounded rationality, decision-making with limited information-processing resources has been studied extensively in psychology (Gigerenzer and Todd, 1999;Camerer, 2003;Brighton, 2009), economics (McKelvey andPalfrey, 1995;Rubinstein, 1998;Kahneman, 2003;Parkes and Wellman, 2015), political science (Jones, 2003), industrial organization (Spiegler, 2011), cognitive science (Howes et al, 2009;Janssen et al, 2011), computer science, and artificial intelligence research (Horvitz, 1988;Lipman, 1995;Russell, 1995;Russell and Subramanian, 1995;Russell and Norvig, 2002;Lewis et al, 2014). Conceptually, the approaches differ widely ranging from heuristics (Tversky and Kahneman, 1974;Gigerenzer and Todd, 1999;Gigerenzer and Brighton, 2009;Burns et al, 2013) to approximate statistical inference schemes (Levy et al, 2009;Vul et al, 2009Vul et al, , 2014Sanborn et al, 2010;Tenenbaum et al, 2011;Fox and Roberts, 2012;Lieder et al, 2012).…”
Section: Introductionmentioning
confidence: 99%
“…We compare the different techniques on the platform pathfinding benchmark of Burns et al (2013b). This domain is inspired by popular platform-based video games like Super Mario Bros.…”
Section: Experimental Evaluationmentioning
confidence: 99%
“…For our experiments we used 25 test instances created using the level generator described by Burns et al (2013b), where the maze for each instance was unique and had a random start and goal location. We used the offline training techniques described above to learn the amount of time required to perform different amounts of lookahead search.…”
Section: Experimental Evaluationmentioning
confidence: 99%
See 2 more Smart Citations