Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
anytime algorithms
Description:
Anytime algorithms are computational procedures that can provide a valid solution quickly and improve it as more computation time becomes available.
Related topics:
Robotic Path Planning Algorithms (10%),
Constraint Satisfaction and Optimization (8%),
AI-based Problem Solving and Planning (7%)
Wikidata ID:
wiki/Q2835760
OpenAlex ID:
keywords/anytime-algorithms
Point-based value iteration: an anytime algorithm for POMDPs
2003
·
Joëlle Pineau
, Geoff Gordon
, et al.
·
International Joint Conference on Artificial Intelligence
·
1,209
Methods for task allocation via agent coalition formation
1998
·
Onn Shehory
, Sarit Kraus
·
Artificial Intelligence
·
1,196
PDF
Matrix Profile I: All Pairs Similarity Joins for Time Series: A Unifying View That Includes Motifs, Discords and Shapelets
2016
·
Chin-Chia Michael Yeh
, Yan Zhu
, et al.
·
Proceedings
·
967
Experiences with an interactive museum tour-guide robot
1999
·
Wolfram Burgard
, Armin B. Cremers
, et al.
·
Artificial Intelligence
·
961
PDF
An analysis of time-dependent planning
1988
·
Thomas Dean
, Mark Boddy
·
National Conference on Artificial Intelligence
·
922
Using anytime algorithms in intelligent systems
1996
·
Shlomo Zilberstein
·
ScholarWorks@UMassAmherst (University of Massachusetts Amherst)
·
891
ARA*: Anytime A* with Provable Bounds on Sub-Optimality
2003
·
Maxim Likhachev
, Geoffrey J. Gordon
, et al.
·
neural information processing systems
·
886
Coalition structure generation with worst case guarantees
1999
·
Tuomas Sandholm
, Kate Larson
, et al.
·
Artificial Intelligence
·
824
PDF
Anytime dynamic A*: an anytime, replanning algorithm
2005
·
Maxim Likhachev
, Dave Ferguson
, et al.
·
International Conference on Automated Planning and Scheduling
·
709
Scalable Information-Driven Sensor Querying and Routing for Ad Hoc Heterogeneous Sensor Networks
2002
·
Maurice Chu
, Horst Haussecker
, et al.
·
The International Journal of High Performance Computing Applications
·
699
Probabilistic discovery of time series motifs
2003
·
Bill Chiu
, Eamonn Keogh
, et al.
·
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
·
655
Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs
2015
·
Jonathan D. Gammell
, Siddhartha S. Srinivasa
, et al.
·
Proceedings - IEEE International Conference on Robotics and Automation/Proceedings
·
637
PDF
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches
1999
·
Yuzo Fujishima
, Kevin Leyton‐Brown
, et al.
·
International Joint Conference on Artificial Intelligence
·
494
Anytime Point-Based Approximations for Large POMDPs
2006
·
J. Pineau
, G. Gordon
, et al.
·
Journal of Artificial Intelligence Research
·
449
PDF
Batch Informed Trees (BIT*): Sampling-based Optimal Planning via the Heuristically Guided Search of Implicit Random Geometric Graphs
·
Jonathan D. Gammell
, Siddhartha S. Srinivasa
, et al.
·
398
Anytime Bottom-Up Rule Learning for Knowledge Graph Completion
2019
·
Christian Meilicke
, Melisachew Wudage Chekol
, et al.
·
International Joint Conference on Artificial Intelligence
·
386
PDF
Automated Driving in Uncertain Environments: Planning With Interaction and Uncertain Maneuver Prediction
2018
·
Constantin Hubmann
, Jens Schulz
, et al.
·
IEEE Transactions on Intelligent Vehicles
·
340
Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
2004
·
Weixiong Zhang
, Guandong Wang
, et al.
·
Artificial Intelligence
·
340
A Dual Approach to Scalable Verification of Deep Networks
2018
·
Krishnamurthy
, Dvijotham
, et al.
·
arXiv (Cornell University)
·
325
PDF
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence
2022
·
319
PDF
Anytime Heuristic Search
2007
·
E. A. Hansen
, R. Zhou
·
Journal of Artificial Intelligence Research
·
303
PDF
On-Line Student Modeling for Coached Problem Solving Using Bayesian Networks
1997
·
Cristina Conati
, Abigail S. Gertner
, et al.
·
Springer eBooks
·
302
A Guide to Heuristic-based Path Planning
2005
·
Dave Ferguson
, Maxim Likhachev
, et al.
·
299
Batch Informed Trees (BIT*): Informed asymptotically optimal anytime search
2020
·
Jonathan D Gammell
, Timothy D Barfoot
, et al.
·
The International Journal of Robotics Research
·
292
PDF
An Anytime Algorithm for Optimal Coalition Structure Generation
2009
·
T. Rahwan
, S. D. Ramchurn
, et al.
·
Journal of Artificial Intelligence Research
·
289
PDF
Show more works
View as search
Works count:
1,968
Citation count:
40,180
Year
Topic
Type