deletions | additions
diff --git a/bibliography/biblio.bib b/bibliography/biblio.bib
index 341fbdf..896e8b8 100644
--- a/bibliography/biblio.bib
+++ b/bibliography/biblio.bib
...
@inproceedings{bererton2003auction,
title={Auction title = {{Auction mechanism design for multi-robot
coordination},
author={Bererton, coordination}},
author = {Bererton, Curt and Gordon, Geoffrey J and Thrun, Sebastian},
booktitle={Advances booktitle = {Advances in Neural Information Processing Systems},
pages={None},
year={2003} pages = {None},
year = {2003},
}
@article{sharon2012increasing,
title={The title = {{The increasing cost tree search for optimal multi-agent
pathfinding},
author={Sharon, pathfinding}},
author = {Sharon, Guni and Stern, Roni and Goldenberg, Meir and Felner, Ariel},
journal={Artificial journal = {Artificial Intelligence},
year={2012},
publisher={Elsevier} year = {2012},
publisher = {Elsevier},
}
@inproceedings{dolgov2005computationally,
title={Computationally-efficient title = {{Computationally-efficient combinatorial auctions for resource allocation in weakly-coupled
MDPs},
author={Dolgov, MDPs}},
author = {Dolgov, Dmitri and Durfee, Edmund},
booktitle={Proceedings booktitle = {Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems},
pages={657--664},
year={2005},
organization={ACM} pages = {657--664},
year = {2005},
organization = {ACM},
}
@article{gerkey2002sold,
title={Sold!: title = {{Sold!: Auction methods for multirobot
coordination},
author={Gerkey, coordination}},
author = {Gerkey, Brian P and Mataric, Maja J},
journal={Robotics journal = {Robotics and Automation, IEEE Transactions on},
volume={18},
number={5},
pages={758--768},
year={2002},
publisher={IEEE} volume = {18},
number = {5},
pages = {758--768},
year = {2002},
publisher = {IEEE},
}
@incollection{tovey2005generation,
title={The title = {{The generation of bidding rules for auction-based robot
coordination},
author={Tovey, coordination}},
author = {Tovey, Craig and Lagoudakis, Michail G and Jain, Sonal and Koenig, Sven},
booktitle={Multi-Robot booktitle = {Multi-Robot Systems. From Swarms to Intelligent Automata Volume III},
pages={3--14},
year={2005},
publisher={Springer} pages = {3--14},
year = {2005},
publisher = {Springer},
}
@article{cramton2006combinatorial,
title={Combinatorial auctions},
author={Cramton, title = {{Combinatorial auctions}},
author = {Cramton, Peter and Shoham, Yoav and Steinberg, Richard},
year={2006},
publisher={MIT Press} year = {2006},
publisher = {MIT Press},
}
@inproceedings{surynek2010optimization,
title={An title = {{An Optimization Variant of Multi-Robot Path Planning Is
Intractable.},
author={Surynek, Intractable.}},
author = {Surynek, Pavel},
booktitle={AAAI},
year={2010} booktitle = {AAAI},
year = {2010},
}
@inproceedings{srinivasan1990algorithms,
title={Algorithms title = {{Algorithms for discrete function
manipulation},
author={Srinivasan, manipulation}},
author = {Srinivasan, Arvind and Ham, T and Malik, Sharad and Brayton, Robert K},
booktitle={Computer-Aided booktitle = {Computer-Aided Design, 1990. ICCAD-90. Digest of Technical Papers., 1990 IEEE International Conference on},
pages={92--95},
year={1990},
organization={IEEE} pages = {92--95},
year = {1990},
organization = {IEEE},
}
@article{cramton2006clock,
title={The title = {{The clock-proxy auction: A practical combinatorial auction
design},
author={Cramton, design}},
author = {Cramton, Peter and Ausubel, Lawrence M},
year={2006},
publisher={MIT Press} year = {2006},
publisher = {MIT Press},
}
@article{song2003combinatorial,
title={Combinatorial title = {{Combinatorial auctions for transportation service procurement: The carrier
perspective},
author={Song, perspective}},
author = {Song, Jiongjiong and Regan, Amelia},
journal={Transportation journal = {Transportation Research Record: Journal of the Transportation Research Board},
volume={1833},
number={1},
pages={40--46},
year={2003},
publisher={Trans volume = {1833},
number = {1},
pages = {40--46},
year = {2003},
publisher = {Trans Res
Board} Board},
}
@article{rassenti1982combinatorial,
title={A title = {{A combinatorial auction mechanism for airport time slot
allocation},
author={Rassenti, allocation}},
author = {Rassenti, Stephen J and Smith, Vernon L and Bulfin, Robert L},
journal={The journal = {The Bell Journal of Economics},
pages={402--417},
year={1982},
publisher={JSTOR} pages = {402--417},
year = {1982},
publisher = {JSTOR},
}
@article{ryan2008exploiting,
title={Exploiting title = {{Exploiting Subgraph Structure in Multi-Robot Path
Planning.},
author={Ryan, Planning.}},
author = {Ryan, Malcolm Ross Kinsella},
journal={J. journal = {J. Artif. Intell. Res.(JAIR)},
volume={31},
pages={497--542},
year={2008} volume = {31},
pages = {497--542},
year = {2008},
}
@inproceedings{ryan2010constraint,
title={Constraint-based title = {{Constraint-based multi-robot path
planning},
author={Ryan, planning}},
author = {Ryan, Malcolm},
booktitle={Robotics booktitle = {Robotics and Automation (ICRA), 2010 IEEE International Conference on},
pages={922--928},
year={2010},
organization={IEEE} pages = {922--928},
year = {2010},
organization = {IEEE},
}
@inproceedings{khorshid2011polynomial,
title={A title = {{A polynomial-time algorithm for non-optimal multi-agent
pathfinding},
author={Khorshid, pathfinding}},
author = {Khorshid, Mokhtar M and Holte, Robert C and Sturtevant, Nathan R},
booktitle={Fourth booktitle = {Fourth Annual Symposium on Combinatorial Search},
year={2011} year = {2011},
}
@inproceedings{silver2005cooperative,
title={Cooperative Pathfinding.},
author={Silver, title = {{Cooperative Pathfinding.}},
author = {Silver, David},
booktitle={AIIDE},
pages={117--122},
year={2005} booktitle = {AIIDE},
pages = {117--122},
year = {2005},
}
@inproceedings{standley2010finding,
title={Finding title = {{Finding Optimal Solutions to Cooperative Pathfinding
Problems.},
author={Standley, Problems.}},
author = {Standley, Trevor Scott},
booktitle={AAAI},
year={2010} booktitle = {AAAI},
year = {2010},
}
@inproceedings{kishimoto2008optimized,
title={Optimized title = {{Optimized algorithms for multi-agent
routing},
author={Kishimoto, routing}},
author = {Kishimoto, Akihiro and Sturtevant, Nathan},
booktitle={Proceedings booktitle = {Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems-Volume 3},
pages={1585--1588},
year={2008},
organization={International pages = {1585--1588},
year = {2008},
organization = {International Foundation for Autonomous Agents and Multiagent
Systems} Systems},
}
@article{sandholm2005cabob,
title={CABOB: title = {{CABOB: A fast optimal algorithm for winner determination in combinatorial
auctions},
author={Sandholm, auctions}},
author = {Sandholm, Tuomas and Suri, Subhash and Gilpin, Andrew and Levine, David},
journal={Management journal = {Management Science},
volume={51},
number={3},
pages={374--390},
year={2005},
publisher={INFORMS} volume = {51},
number = {3},
pages = {374--390},
year = {2005},
publisher = {INFORMS},
}
@inproceedings{hunsberger2000combinatorial,
title={A title = {{A combinatorial auction for collaborative
planning},
author={Hunsberger, planning}},
author = {Hunsberger, Luke and Grosz, Barbara J},
booktitle={MultiAgent booktitle = {MultiAgent Systems, 2000. Proceedings. Fourth International Conference on},
pages={151--158},
year={2000},
organization={IEEE} pages = {151--158},
year = {2000},
organization = {IEEE},
}
@article{parkes2006iterative,
title={Iterative title = {{Iterative combinatorial
auctions},
author={Parkes, auctions}},
author = {Parkes, David},
journal={Combinatorial auctions},
pages={41--77},
year={2006},
publisher={MIT Press} journal = {Combinatorial auctions},
pages = {41--77},
year = {2006},
publisher = {MIT Press},
}
@inproceedings{parkes2001iterative,
title={An title = {{An iterative generalized Vickrey auction: Strategy-proofness without complete
revelation},
author={Parkes, revelation}},
author = {Parkes, David C},
booktitle={Proceedings booktitle = {Proceedings of AAAI Spring Symposium on Game Theoretic and Decision Theoretic Agents},
pages={78--87},
year={2001} pages = {78--87},
year = {2001},
}
@article{dias2006market,
title={Market-based title = {{Market-based multirobot coordination: A survey and
analysis},
author={Dias, analysis}},
author = {Dias, M Bernardine and Zlot, Robert and Kalra, Nidhi and Stentz, Anthony},
journal={Proceedings journal = {Proceedings of the IEEE},
volume={94},
number={7},
pages={1257--1270},
year={2006},
publisher={IEEE} volume = {94},
number = {7},
pages = {1257--1270},
year = {2006},
publisher = {IEEE},
}
@inproceedings{koenig2010progress,
title={Progress title = {{Progress on Agent Coordination with Cooperative
Auctions.},
author={Koenig, Auctions.}},
author = {Koenig, Sven and Keskinocak, Pinar and Tovey, Craig A},
booktitle={AAAI},
year={2010} booktitle = {AAAI},
year = {2010},
}
@article{sandholm2002algorithm,
title={Algorithm title = {{Algorithm for optimal winner determination in combinatorial
auctions},
author={Sandholm, auctions}},
author = {Sandholm, Tuomas},
journal={Artificial journal = {Artificial intelligence},
volume={135},
number={1},
pages={1--54},
year={2002},
publisher={Elsevier} volume = {135},
number = {1},
pages = {1--54},
year = {2002},
publisher = {Elsevier},
}
@inproceedings{parkes1999bundle,
title={i title = {{i Bundle: an efficient ascending price bundle
auction},
author={Parkes, auction}},
author = {Parkes, David C},
booktitle={Proceedings booktitle = {Proceedings of the 1st ACM conference on Electronic commerce},
pages={148--157},
year={1999},
organization={ACM} pages = {148--157},
year = {1999},
organization = {ACM},
}
@article{nanjanath2010repeated,
title={Repeated title = {{Repeated auctions for robust task execution by a robot
team},
author={Nanjanath, team}},
author = {Nanjanath, Maitreyi and Gini, Maria},
journal={Robotics journal = {Robotics and Autonomous Systems},
volume={58},
number={7},
pages={900--909},
year={2010},
publisher={Elsevier} volume = {58},
number = {7},
pages = {900--909},
year = {2010},
publisher = {Elsevier},
}
@inproceedings{bnaya2013multi,
title={Multi-Agent title = {{Multi-Agent Path Finding for Self Interested
Agents},
author={Bnaya, Agents}},
author = {Bnaya, Zahy and Stern, Roni and Felner, Ariel and Zivan, Roie and Okamoto, Steven},
booktitle={Sixth booktitle = {Sixth Annual Symposium on Combinatorial Search},
year={2013} year = {2013},
}
@inproceedings{sharon2012meta,
title={Meta-Agent title = {{Meta-Agent Conflict-Based Search For Optimal Multi-Agent Path
Finding.},
author={Sharon, Finding.}},
author = {Sharon, Guni and Stern, Roni and Felner, Ariel and Sturtevant, Nathan R},
booktitle={SOCS},
year={2012} booktitle = {SOCS},
year = {2012},
}
@inproceedings{sharon2012conflict,
title={Conflict-Based title = {{Conflict-Based Search For Optimal Multi-Agent Path
Finding.},
author={Sharon, Finding.}},
author = {Sharon, Guni and Stern, Roni and Felner, Ariel and Sturtevant, Nathan R},
booktitle={AAAI},
year={2012} booktitle = {AAAI},
year = {2012},
}
@inproceedings{EPEA,
author = {Ariel Felner and Meir Goldenberg and Guni Sharon and Roni Stern and Tal Beja and Nathan R. Sturtevant and Jonathan Schaeffer and Robert
Holte }, Holte},
title =
{Partial-Expansion {{Partial-Expansion A* with Selective Node
Generation}, Generation}},
booktitle = {AAAI},
pages = {471 -477},
year =
{2012} {2012},
}
@article{NATHANS,
author = {Nathan R. Sturtevant},
title =
{Benchmarks {{Benchmarks for Grid-Based
Pathfinding}, Pathfinding}},
journal = {IEEE Trans. Comput. Intellig. and AI in Games},
volume = {4},
number = {2},
year = {2012},
pages =
{144-148} {144-148},
}
@inproceedings{sun2009simpleOptimization,
author = {Xiaoxun Sun and William Yeoh and Po-An Chen and Sven Koenig},
title =
{Simple {{Simple optimization techniques for {A}*-based
search}, search}},
booktitle = {AAMAS},
year = {2009},
pages =
{931--936} {931--936},
}
@inproceedings{DBLP:conf/aaai/SternKFH10, @inproceedings{SturtevantB06,
author =
{Roni Stern
and Tamar Kulberis and
Ariel Felner {Nathan R. Sturtevant and
Robert Holte}, Michael H. Bowling},
title =
{Using Lookaheads with Optimal Best-First Search}, {{Robust game play against unknown opponents}},
booktitle =
{AAAI}, {AAMAS},
year =
{2010}, {2006},
pages =
{185-190} {713-719},
}
@inproceedings{DBLP:conf/socs/KhorshidHS11, @inproceedings{SturtevantZB06,
author =
{Mokhtar M. Khorshid {Nathan R. Sturtevant and
Robert C. Holte Martin Zinkevich and
Nathan R. Sturtevant}, Michael H. Bowling},
title =
{A Polynomial-Time Algorithm for Non-Optimal Multi-Agent
Pathfinding}, {{Prob-Maxn: Playing N-Player Games with Opponent Models}},
booktitle =
{SOCS}, {AAAI},
year =
{2011},
pages = {76-83} {2006},
}
@inproceedings{DBLP:conf/ijcai/LunaB11, @inproceedings{SturtevantJ07,
author =
{Ryan Luna {N. Sturtevant and
Kostas E. Bekris}, M. Jansen},
title =
{Push {{An Analysis of Map-Based Abstraction and
Swap: Fast Cooperative Path-Finding with Completeness
Guarantees}, Refinement}},
booktitle =
{IJCAI}, {SARA},
year =
{2011}, {2007},
pages =
{294-300} {344-358},
}
@inproceedings{DBLP:conf/wafr/GradyBK10, @inproceedings{Sturtevant03,
author =
{Devin K. Grady and
Kostas E. Bekris and
Lydia E. Kavraki}, {Nathan R. Sturtevant},
title =
{Asynchronous Distributed Motion Planning with Safety Guarantees
under Second-Order Dynamics}, {{Last-Branch and Speculative Pruning Algorithms for Max$^{\mbox{n}}$}},
booktitle =
{WAFR}, {IJCAI},
year =
{2010}, {2003},
pages =
{53-70} {669-678},
}
@inproceedings{DBLP:conf/atal/GilboaMF06, @inproceedings{Sturtevant04,
author =
{Arnon Gilboa and
Amnon Meisels and
Ariel Felner}, {Nathan R. Sturtevant},
title =
{Distributed navigation {{Current Challenges in
an unknown physical environment}, Multi-player Game Search}},
booktitle =
{AAMAS}, {Computers and Games},
year =
{2006}, {2004},
pages =
{553-560} {285-300},
}
@inproceedings{DBLP:conf/aaai/BergSHG11, @inproceedings{GUNI2011,
author =
{Jur van den Berg {Guni Sharon and
Rajat Shah Roni Stern and
Arthur Huang and
Kenneth Y. Goldberg},
title = {Anytime Nonparametric {A*}},
booktitle = {AAAI},
pages = {105-111},
year = {2011}
}
@inproceedings{DBLP:conf/aaai/Korf97,
author = {Richard E. Korf},
title = {Finding Optimal Solutions to Rubik's Cube Using Pattern
Databases},
booktitle = {AAAI/IAAI},
year = {1997},
pages = {700-705}
}
@article{DBLP:journals/ai/BonetG01,
author = {Blai Bonet and
Hector Geffner},
title = {Planning as heuristic search},
journal = {Artif. Intell.},
volume = {129},
number = {1-2},
year = {2001},
pages = {5-33}
}
@book{DBLP:books/sp/Helmert2008,
author = {Malte Helmert},
title = {Understanding Planning Tasks: Domain Complexity and Heuristic
Decomposition},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {4929},
year = {2008},
isbn = {978-3-540-77722-9}
}
@inproceedings{SturtevantB06,
author = {Nathan R. Sturtevant and
Michael H. Bowling},
title = {Robust game play against unknown opponents},
booktitle = {AAMAS},
year = {2006},
pages = {713-719},
}
@inproceedings{SturtevantZB06,
author = {Nathan R. Sturtevant and
Martin Zinkevich and
Michael H. Bowling},
title = {Prob-Maxn: Playing N-Player Games with Opponent Models},
booktitle = {AAAI},
year = {2006},
}
@inproceedings{SturtevantJ07,
author = {N. Sturtevant and
M. Jansen},
title = {An Analysis of Map-Based Abstraction and Refinement},
booktitle = {SARA},
year = {2007},
pages = {344-358},
}
@inproceedings{Sturtevant03,
author = {Nathan R. Sturtevant},
title = {Last-Branch and Speculative Pruning Algorithms for Max$^{\mbox{n}}$},
booktitle = {IJCAI},
year = {2003},
pages = {669-678},
}
@inproceedings{Sturtevant04,
author = {Nathan R. Sturtevant},
title = {Current Challenges in Multi-player Game Search},
booktitle = {Computers and Games},
year = {2004},
pages = {285-300},
}
@inproceedings{GUNI2011,
author = {Guni Sharon and
Roni Stern and
Meir Goldenberg Meir Goldenberg and Ariel Felner},
title =
{The {{The Increasing Cost Tree Search for Optimal Multi-Agent
Pathfinding}, Pathfinding}},
booktitle = {IJCAI},
year = {2011},
pages =
{662-667} {662-667},
}
@inproceedings{GUNISOCS2011,
author = {Guni Sharon and Roni Stern and Meir Goldenberg and Ariel Felner},
title =
{Pruning {{Pruning Techniques for the Increasing Cost Tree Search for Optimal Multi-agent
Pathfinding}, Pathfinding}},
booktitle = {SOCS},
year = {2011},
pages =
{150-157} {150-157},
}
@inproceedings{Sturtevant05,
author = {Nathan R. Sturtevant},
title =
{Leaf-Value {{Leaf-Value Tables for Pruning Non-Zero-Sum
Games}, Games}},
booktitle = {IJCAI},
year = {2005},
pages = {317-323},
}
@article{BulitkoSLY07,
author = {Vadim Bulitko and Nathan R. Sturtevant and Jieshan Lu and Timothy Yau},
title =
{Graph {{Graph Abstraction in Real-time Heuristic
Search}, Search}},
journal = {J. Artif. Intell. Res. (JAIR)},
volume = {30},
year = {2007},
pages = {51-100},
}
@inproceedings{SturtevantBB10,
author = {Nathan R. Sturtevant and Vadim Bulitko and Yngvi Bj{\"o}rnsson},
title =
{On {{On learning in agent-centered
search}, search}},
booktitle = {AAMAS},
year = {2010},
pages = {333-340},
}
@inproceedings{Sturtevant07,
author = {Nathan R. Sturtevant},
title =
{Memory-Efficient {{Memory-Efficient Abstractions for
Pathfinding}, Pathfinding}},
booktitle = {AIIDE},
year = {2007},
pages = {31-36},
}
@inproceedings{SturtevantB05,
author = {Nathan R. Sturtevant and Michael Buro},
title =
{Partial {{Partial Pathfinding Using Map Abstraction and
Refinement}, Refinement}},
booktitle = {AAAI},
year = {2005},
pages = {1392-1397},
}
@inproceedings{trees,
author =
"E. {E. Masehian and A.H.
Nejad", Nejad},
title =
"Solvability {{Solvability of multi robot motion planning problems on
trees.", trees.}},
booktitle =
"Proceedings {Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and
systems", systems},
year =
2009, {2009},
pages =
"5936 {5936 -
5941" 5941},
}
@inproceedings{CHAIIDE,
author = {Nathan R. Sturtevant and Robert Geisberger},
title =
{A {{A Comparison of High-Level Approaches for Speeding Up
Pathfinding}, Pathfinding}},
booktitle = {AIIDE},
year = {2010},
pages =
{76-82} {76-82},
}
@inproceedings{CH,
author = {Robert Geisberger and Peter Sanders and Dominik Schultes and Daniel Delling},
title =
{Contraction {{Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road
Networks}, Networks}},
booktitle = {WEA},
year = {2008},
pages =
{319-333} {319-333},
}
@ARTICLE{Tomlin98conflictresolution,
author = {Claire Tomlin and George J. Pappas and Shankar Sastry},
title =
{Conflict {{Conflict Resolution for Air Traffic Management: a Study in Multi-Agent Hybrid
Systems}, Systems}},
journal = {IEEE Transactions on Automatic Control},
year = {1998},
volume = {43},
pages =
{509-521} {509-521},
}
@MISC{Rock00randomizedkinodynamic,
author = {Kindel Rock and Robert Kindel and Jean-Claude Latombe and Stephen Rock and David Hsu and Robert Jean-claude and Latombe Stephen},
title =
{Randomized {{Randomized Kinodynamic Motion Planning with Moving
Obstacles}, Obstacles}},
year =
{2000} {2000},
}
@INPROCEEDINGS{Ng01predictinginternet,
author = {T. S. Eugene Ng and Hui Zhang},
title =
{Predicting {{Predicting Internet Network Distance with Coordinates-Based
Approaches}, Approaches}},
booktitle = {In INFOCOM},
year = {2001},
pages =
{170-179} {170-179},
}
@inproceedings{sturtevantburo,
author = {Nathan R. Sturtevant and Michael Buro},
title =
{Improving {{Improving Collaborative Pathfinding Using Map
Abstraction}, Abstraction}},
booktitle = {AIIDE},
year = {2006},
pages =
{80-85}
}
@inproceedings{DBLP:conf/aaai/FelnerMSS10,
author = {A. Felner and
C. Moldenhauer and
N. R. Sturtevant and
J. Schaeffer},
title = {Single-Frontier Bidirectional Search},
booktitle = {AAAI},
year = {2010} {80-85},
}
@inproceedings{Protal2010,
author = {M. Goldenberg and A. Felner and N. R. Sturtevant and J. Schaeffer},
title =
{Portal-Based {{Portal-Based True-Distance Heuristics for Path
Finding}, Finding}},
booktitle = {Second International Symposium on Combinatorial Search (SoCS)},
pages = {39-45},
year =
{2010} {2010},
}
@inproceedings{DBLP:conf/aips/ThayerR08, @inproceedings{GoldbergH05,
author =
{J. Tyler Thayer and
W. Ruml},
title = {Faster than Weighted A*: An Optimistic Approach to Bounded
Suboptimal Search},
booktitle = {ICAPS},
year = {2008},
pages = {355-362}
}
@inproceedings{DBLP:conf/aips/ThayerR09,
author = {J. Tyler Thayer and
W. Ruml},
title = {Using Distance Estimates in Heuristic Search},
booktitle = {ICAPS},
year = {2009}
}
@inproceedings{DBLP:conf/aips/RichterTR10,
author = {Silvia Richter and
Jordan Tyler Thayer and
Wheeler Ruml},
title = {The Joy of Forgetting: Faster Anytime Search via Restarting},
booktitle = {ICAPS},
year = {2010},
pages = {137-144}
}
@inproceedings{DBLP:conf/iccad/SrinivasanKMB90,
author = {A. Srinivasan and
T. Kam and
S. Malik and
R. K. Brayton},
title = {Algorithms for Discrete Function Manipulation},
booktitle = {ICCAD},
year = {1990},
pages = {92-95}
}
@inproceedings{DBLP:conf/aaai/LarsenBRH10,
author = {B. Larsen and
E. Burns and
W. Ruml and
R. Holte},
title = {Searching Without a Heuristic: Efficient Use of Abstraction},
booktitle = {AAAI},
year = {2010}
}
@inproceedings{DBLP:conf/aaai/PochterZRF10,
author = {N. Pochter and
A. Zohar and
J. S. Rosenschein and
A. Felner},
title = {Search Space Reduction Using Swamp Hierarchies},
booktitle = {AAAI},
year = {2010}
}
@inproceedings{DBLP:conf/sara/AndersonHS07,
author = {K. Anderson and
R. Holte and
J. Schaeffer},
title = {Partial Pattern Databases},
booktitle = {SARA},
year = {2007},
pages = {20-34}
}
@inproceedings{GoldbergH05,
author = {Andrew V. Goldberg {Andrew V. Goldberg and Chris Harrelson},
title =
{Computing {{Computing the shortest path: A* search meets graph
theory}, theory}},
booktitle = {SODA},
year = {2005},
pages =
{156-165} {156-165},
}
@inproceedings{jansen2008directionMaps,
author = {M. Jansen and N. Sturtevant},
title =
{Direction {{Direction Maps for Cooperative
Pathfinding}, Pathfinding}},
booktitle = {AIIDE},
year =
{2008} {2008},
}
@inproceedings{jansen2008aNewApproach,
author = {M. Renee Jansen and Nathan R. Sturtevant},
title =
{A {{A new approach to cooperative
pathfinding}, pathfinding}},
booktitle = {AAMAS (3)},
year = {2008},
pages =
{1401-1404} {1401-1404},
}
@inproceedings{silver2005coopeartive,
author = {David Silver},
title =
{Cooperative Pathfinding}, {{Cooperative Pathfinding}},
booktitle = {AIIDE},
year = {2005},
pages =
{117-122} {117-122},
}
@inproceedings{silverbook,
author = {David Silver},
title =
{Cooperative Pathfinding}, {{Cooperative Pathfinding}},
booktitle = {AI Game Programming Wisdom 3},
year = {2006},
}
@inproceedings{WangB08,
author = {Ko-Hsin Cindy Wang and Adi Botea},
title =
{Fast {{Fast and Memory-Efficient Multi-Agent
Pathfinding}, Pathfinding}},
booktitle = {ICAPS},
year = {2008},
pages =
{380-387} {380-387},
}
@inproceedings{WangB09,
author = {Ko-Hsin Cindy Wang and Adi Botea},
title =
{Tractable {{Tractable Multi-Agent Path Planning on Grid
Maps}, Maps}},
booktitle = {IJCAI},
year = {2009},
pages =
{1870-1875} {1870-1875},
}
@inproceedings{DBLP:conf/icra/Ryan10, @inproceedings{Korf2009multiWay,
author =
{Malcolm Ryan}, {Richard E. Korf},
title =
{Constraint-based multi-robot path planning}, {{Multi-Way Number Partitioning}},
booktitle =
{ICRA}, {IJCAI},
year =
{2010}, {2009},
pages =
{922-928} {538-543},
}
@inproceedings{DBLP:conf/aips/DomshlakKL10, @inproceedings{standley2010findingOptimal,
author =
{Carmel Domshlak and
Michael Katz and
Sagi Lefler}, {Trevor S. Standley},
title =
{When Abstractions Met Landmarks}, {{Finding Optimal Solutions to Cooperative Pathfinding Problems}},
booktitle =
{ICAPS}, {AAAI},
year = {2010},
pages =
{50-56} {173-178},
}
@inproceedings{DBLP:conf/aips/HelmertD09, @inproceedings{wang2009tractableMultiagent,
author =
{Malte Helmert {Wang, K. C. and
Carmel Domshlak}, Botea, A.},
title =
{Landmarks, Critical Paths and Abstractions: What's the Difference
Anyway?}, {{Tractable multi-agent path planning on grid maps}},
booktitle =
{ICAPS}, {IJCAI'09: Proceedings of the 21st international jont conference on Artifical intelligence},
year =
{2009}
}
@inproceedings{DBLP:conf/aips/KatzD09,
author = {Michael Katz and
Carmel Domshlak},
title {2009},
pages =
{Structural-Pattern Databases},
booktitle {1870-1875},
location =
{ICAPS},
year {Pasadena, California, USA},
address =
{2009} {{San Francisco, CA, USA}},
}
@inproceedings{DBLP:conf/aips/KatzD08, @Article{dresner2008aMultiagent,
author =
{Michael Katz {Kurt Dresner and
Carmel Domshlak}, Peter Stone},
title =
{Structural Patterns Heuristics via Fork Decomposition},
booktitle {{A Multiagent Approach to Autonomous Intersection Management}},
journal =
{ICAPS}, {JAIR},
month = {March},
year = {2008},
volume = {31},
pages =
{182-189} {591-656},
}
@inproceedings{DBLP:conf/aips/BallH08, @BOOK{nilsson98,
author =
{Marcel Ball and
Robert C. Holte}, {Nils Nilsson},
title =
{The Compression Power of Symbolic Pattern Databases},
booktitle = {ICAPS},
year = {2008},
pages = {2-11}
}
@inproceedings{Korf2009multiWay,
author = {Richard E. Korf},
title = {Multi-Way Number Partitioning},
booktitle = {IJCAI},
year = {2009},
pages = {538-543}
}
@inproceedings{DBLP:conf/ijcai/StandleyK11,
author = {Trevor S. Standley and
Richard E. Korf},
title = {Complete Algorithms for Cooperative Pathfinding Problems},
booktitle = {IJCAI},
year = {2011},
pages = {668-673}
}
@inproceedings{standley2010findingOptimal,
author = {Trevor S. Standley},
title = {Finding Optimal Solutions to Cooperative Pathfinding Problems},
booktitle = {AAAI},
year = {2010},
pages = {173-178}
}
@article{DBLP:journals/ras/BennewitzBT02,
author = {Maren Bennewitz and
Wolfram Burgard and
Sebastian Thrun},
title = {Finding and optimizing solvable priority schemes for decoupled
path planning techniques for teams of mobile robots},
journal = {Robotics and Autonomous Systems},
volume = {41},
number = {2-3},
year = {2002},
pages = {89-99}
}
@article{DBLP:journals/trob/PallottinoSBF07,
author = {Lucia Pallottino and
Vincenzo Giovanni Scordio and
Antonio Bicchi and
Emilio Frazzoli},
title = {Decentralized Cooperative Policy for Conflict Resolution
in Multivehicle Systems},
journal = {IEEE Transactions on Robotics},
volume = {23},
number = {6},
year = {2007},
pages = {1170-1183}
}
@article{DBLP:journals/aim/KitanoT01,
author = {Hiroaki Kitano and
Satoshi Tadokoro},
title = {RoboCup Rescue: A Grand Challenge for Multiagent and Intelligent
Systems},
journal = {AI Magazine},
volume = {22},
number = {1},
year = {2001},
pages = {39-52},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{wang2009tractableMultiagent,
author = {Wang, K. C. and Botea, A.},
title = {Tractable multi-agent path planning on grid maps},
booktitle = {IJCAI'09: Proceedings of the 21st international jont conference on Artifical intelligence},
year = {2009},
pages = {1870-1875},
location = {Pasadena, California, USA},
address = {San Francisco, CA, USA},
}
@Article{dresner2008aMultiagent,
author="Kurt Dresner and Peter Stone",
title="A Multiagent Approach to Autonomous Intersection Management",
journal = {JAIR},
month = {March},
year = {2008},
volume = {31},
pages = {591-656}
}
@BOOK{nilsson98,
AUTHOR = "Nils Nilsson",
TITLE = "Artificial {{Artificial Intelligence: A New
Synthesis",
PUBLISHER Synthesis}},
publisher =
"Morgan Kaufmann",
YEAR {Morgan Kaufmann},
year =
1998 {1998},
}
@inproceedings{zhouhansen,
AUTHOR author =
"R. {R. Zhou and E. A.
Hansen",
TITLE Hansen},
title =
"Memory-Bounded {{Memory-Bounded {A*} Graph
Search", Search}},
booktitle =
"Florida {Florida Artificial Intelligence Research Society
(FLAIRS-02)",
YEAR (FLAIRS-02)},
year =
2002,
PAGES {2002},
pages =
"203-209" {203-209},
}
@inproceedings{SamadiECAI08,
author = {M. Samadi and M. Siabani and A. Felner and R.C. Holte},
title =
{Compressing {{Compressing Pattern Databases using
Learning}, Learning}},
booktitle = {European Conference on Artificial Intelligence (ECAI-08)},
year = {2008},
pages = {495 - 499},
}
@inproceedings{BallH08,
author =
"M. {M. Ball and R.C.
Holte", Holte},
title =
"The {{The Compression Power of Symbolic Pattern
Databases ", Databases}},
booktitle =
"International {International Conference on Automated Planning and Scheduling
(ICAPS-08)", (ICAPS-08)},
pages =
"2-11", {2-11},
year =
"2008" {2008},
}
@article{Champeaux83,
author = {Dennis de Champeaux},
title =
{Bidirectional {{Bidirectional Heuristic Search
Again}, Again}},
journal = {J. ACM},
volume = {30},
number = {1},
year = {1983},
pages = {22-32},
ee = {db/journals/jacm/Champeaux83.html, http://doi.acm.org/10.1145/322358.322360},
bibsource = {DBLP,
http://dblp.uni-trier.de} http://dblp.uni-trier.de},
}
@article{Pohl71,
author = {Ira Pohl},
title =
{B-directional search}, {{B-directional search}},
journal = {Machine intelligence},
volume =
{6},
year = {1971},
pages = {127-140},
}
@book{slocum,
author="Jerry Slocum and Dic Sonneveld",
title="The 15 Puzzle",
publisher="Slocum Puzzle Foundation",
year=2006}
@article{DBLP:journals/ai/Pohl70,
author = {Ira Pohl},
title = {Heuristic Search Viewed as Path Finding in a Graph},
journal = {Artificial Intelligence},
volume = {1},
number = {3}, {6},
year =
{1970}, {1971},
pages =
{193-204},
bibsource {127-140},
}
@book{slocum,
author =
{DBLP, http://dblp.uni-trier.de} {Jerry Slocum and Dic Sonneveld},
title = {{The 15 Puzzle}},
publisher = {Slocum Puzzle Foundation},
year = {2006},
}
@article{Pohl77,
author = {Ira Pohl},
title =
{Practical {{Practical and theoretical considerations in heuristic search
algorithms}, algorithms}},
journal = {Machine intelligence},
volume = {8},
year = {1977},
pages = {55-72},
}
@article{KBFS03,
author="A. author = {A. Felner and S. Kraus and R. E.
Korf",
title="{KBFS}: Korf},
title = {{{KBFS}: K-Best First
Search",
journal= "Annals Search}},
journal = {Annals of Mathematics and Artificial
Intelligence",
volume= 39,
pages= "19-39",
year=2003} Intelligence},
volume = {39},
pages = {19-39},
year = {2003},
}
@article{NEWGPP,
author="A. Felner",
title="Solving author = {A. Felner},
title = {{Solving the Graph-Partitioning Problem with Heuristic
Search",
journal= "Annals Search}},
journal = {Annals of Mathematics and Artificial
Intelligence",
volume= 67,
pages= "19-39",
year=2006} Intelligence},
volume = {67},
pages = {19-39},
year = {2006},
}
@inproceedings{ICAPS04,
author="R. author = {R. C. Holte and J. Newton and A. Felner and R. Meshulam and D.
Furcy",
title="Multiple Furcy},
title = {{Multiple pattern
databases",
booktitle= "International databases}},
booktitle = {International Conference on Automated Planning and Scheduling
(ICAPS-04)",
pages= "122-131",
year=2004 (ICAPS-04)},
pages = {122-131},
year = {2004},
}
@article{AIJMAXING,
author="R. author = {R. C. Holte and A. Felner and J. Newton and R. Meshulam and D.
Furcy",
title="Maximizing Furcy},
title = {{Maximizing over Multiple Pattern Databases Speeds up Heuristic
Search",
journal= "Artificial Intelligence",
volume= 170,
pages= "1123-1136",
year=2006} Search}},
journal = {Artificial Intelligence},
volume = {170},
pages = {1123-1136},
year = {2006},
}
@inproceedings{DDD03,
author="R. author = {R. E.
Korf",
title="Delayed Korf},
title = {{Delayed Duplicate
Detection",
booktitle="International Detection}},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI-03)",
pages= "1539-1541",
note="Extended abstract",
year=2003 (IJCAI-03)},
pages = {1539-1541},
note = {Extended abstract},
year = {2003},
}
@techreport{robistvan04,
AUTHOR author =
"R. {R. C. Holte and Istvan T.
Hern{\'a}dv{\"o}lgyi",
title="Steps Hern{\'a}dv{\"o}lgyi},
title = {{Steps Towards the Automatic Creation of Search
Heuristics",
institution="Computing Heuristics}},
institution = {Computing Science Department, University of
Alberta",
address="Edmonton, Alberta},
address = {Edmonton, Canada T6G
2E8",
number="TR04-02",
year=2004} 2E8},
number = {TR04-02},
year = {2004},
}
@techreport{ALBET73,
author="S. author = {S. H. Fuller and J. G. Gasching and J. J.
Gillogly",
title="An Gillogly},
title = {{An analysis of the alpha-beta pruning
algorithm",
institution="Department algorithm}},
institution = {Department of Computer
Science",
address="Carnegie-Mellon Science},
address = {Carnegie-Mellon University, Pittsburgh,
Pa",
year=1973} Pa},
year = {1973},
}
@article{ABS93,
author="A. author = {A. E.
Prieditis",
title="Machine Prieditis},
title = {{Machine discovery of effective admissible
heuristics",
journal="Machine Learning",
volume=12,
pages="117-141",
year=1993} heuristics}},
journal = {Machine Learning},
volume = {12},
pages = {117-141},
year = {1993},
}
@article{PERL83,
author="R. author = {R. Karp and J.
Pearl",
title="Searching Pearl},
title = {{Searching for an optimal path in a tree with random
costs",
journal="Artificial Intelligence",
volume="21(1-2)",
pages="99-116",
year=1983} costs}},
journal = {Artificial Intelligence},
volume = {21(1-2)},
pages = {99-116},
year = {1983},
}
@article{Patrick92,
author="B. author = {B. Patrick and M. Amulla and M.
Newborn",
title="An Newborn},
title = {{An upper bound on the time complexity of iteratively-deepening
{A}*",
journal="International {A}*}},
journal = {International Journal of Artificial Intelligence and
Mathematics",
volume="5",
pages="265-277",
year=1992} Mathematics},
volume = {5},
pages = {265-277},
year = {1992},
}
@article{DOWDY82,
author="L. author = {L. W. Dowdy and D. V.
Foster",
title="Comparative Foster},
title = {{Comparative models of the file assignment
problem",
journal="Computing Survey",
volume="14(2)",
pages="289-313",
year=1982} problem}},
journal = {Computing Survey},
volume = {14(2)},
pages = {289-313},
year = {1982},
}
@book{DEEPBLUE,
author="Feng-Hsiung Hsu",
title="Behind author = {Feng-Hsiung Hsu},
title = {{Behind Deep Blue: Building the Computer that Defeated the
World",
publisher="Princeton World}},
publisher = {Princeton University
Press",
year=2002} Press},
year = {2002},
}
@book{ARTIF2002,
author="S. author = {S. Russell and P.
Norvig",
title="Artificial Norvig},
title = {{Artificial Intelligence, A Modern Approach, Second
Edition",
publisher="Prentice Hall",
pages="97-99",
year=2005} Edition}},
publisher = {Prentice Hall},
pages = {97-99},
year = {2005},
}
@book{ARTIF95,
author="S. author = {S. Russell and P.
Norvig",
title="Artificial Norvig},
title = {{Artificial Intelligence, A Modern
Approach",
publisher="Prentice Hall",
pages="111-112",
year=1995} Approach}},
publisher = {Prentice Hall},
pages = {111-112},
year = {1995},
}
@book{PAPA80,
author="C. author = {C. H. Papapdimitriou and K.
Steiglitz",
title="Combinatorial Steiglitz},
title = {{Combinatorial Optimization: Algorithms and
Complexity",
publisher="Prentice Hall",
year=1980} Complexity}},
publisher = {Prentice Hall},
year = {1980},
}
@inproceedings{BreyerKorfSTAIR,
author="Teresa author = {Teresa Breyer and R. E.
Korf",
title="Recent Korf},
title = {{Recent Results in Analyzing the Performance of Heuristic
Search",
booktitle="International Search}},
booktitle = {International Workshop on Search in Artificial Intelligence and Robotics (held in conjunction with
AAAI)",
year= 2008} AAAI)},
year = {2008},
}
@inproceedings{DinhRussellSuAAAI,
author="Hang author = {Hang T. Dinh and Alexander Russell and Yuan
Su",
title="On Su},
title = {{On the Value of Good Advice: The Complexity of {A}* Search with Accurate
Heuristics",
booktitle="National Heuristics}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-07)",
pages="1140-1145",
year= 2007} (AAAI-07)},
pages = {1140-1145},
year = {2007},
}
@inproceedings{SARIT97,
author="R. author = {R. Schwartz and S.
Kraus",
title="Negotiation Kraus},
title = {{Negotiation on data allocation in multi-agent
environments",
booktitle="National environments}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-97)",
pages="29-35",
year= 1997} (AAAI-97)},
pages = {29-35},
year = {1997},
}
@inproceedings{SARA05,
author="A. author = {A. Felner and A.
Adler",
title="Solving Adler},
title = {{Solving the 24-Puzzle with Instance Dependent Pattern
databases",
booktitle="SARA-05",
pages="248-260",
year= 2005} databases}},
booktitle = {SARA-05},
pages = {248-260},
year = {2005},
}
@inproceedings{DUP93,
author="L. author = {L. Taylor and R. E.
Korf",
title="Pruning Korf},
title = {{Pruning duplicate nodes in depth-first
search",
booktitle="National search}},
booktitle = {National Conference on Artificial
Intelligence",
pages="756-761",
year= 1993} Intelligence},
pages = {756-761},
year = {1993},
}
@inproceedings{JUN99,
author="A. author = {A. Junghanns and J.
Schaeffer",
title="Domain-dependent Schaeffer},
title = {{Domain-dependent single-agent search
enhancements",
booktitle="International enhancements}},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI-99)",
pages="570-575",
year= 1999} (IJCAI-99)},
pages = {570-575},
year = {1999},
}
@inproceedings{PROV91,
author="C. author = {C. J. H. MacDiarmid and G. M. A.
Provan",
title="An Provan},
title = {{An expected cost analysis of backtracking and non-backtracking
algorithms",
booktitle="International algorithms}},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI-91)",
pages="173-177 ",
year= 1991} (IJCAI-91)},
pages = {173-177},
year = {1991},
}
@article{DIJ59,
author="E. author = {E. W.
Dijkstra",
title="A Dijkstra},
title = {{A note on two problems in connexion with
graphs",
journal="{\it graphs}},
journal = {{\it Numerische
Mathematik}",
volume="1",
pages="269-271",
year=1959} Mathematik}},
volume = {1},
pages = {269-271},
year = {1959},
}
@article{ASTR85,
author="Rina author = {Rina Dechter and Judea
Pearl",
title="Generalized Pearl},
title = {{Generalized best-first search strategies and the optimality of
{A}*",
journal="Journal {A}*}},
journal = {Journal of the
ACM",
volume="32(3)",
pages="505-536",
year=1985} ACM},
volume = {32(3)},
pages = {505-536},
year = {1985},
}
@article{ASTR68,
author="P. author = {P. E. Hart and N. J. Nilsson and B.
Raphael",
title="A Raphael},
title = {{A formal basis for the heuristic determination of minimum cost
paths",
journal="IEEE paths}},
journal = {IEEE Transactions on Systems Science and
Cybernetics",
volume="SCC-4(2)",
pages="100-107",
year=1968} Cybernetics},
volume = {SCC-4(2)},
pages = {100-107},
year = {1968},
}
@inproceedings{LDS95,
author="W. author = {W. D. Harvey and M. L.
Ginsberg",
title="Limited Ginsberg},
title = {{Limited discrepancy
search",
booktitle="International search}},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI-95)",
pages="607-613 ",
year=1995 (IJCAI-95)},
pages = {607-613},
year = {1995},
}
@inproceedings{OPT24,
author="Richard author = {Richard E. Korf and Larry
Taylor",
title="Finding Taylor},
title = {{Finding optimal solutions to the twenty-four
puzzle",
booktitle="National puzzle}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-96)",
pages="1202-1207",
year=1996 (AAAI-96)},
pages = {1202-1207},
year = {1996},
}
@inproceedings{CRESUS95,
author="P. author = {P. Shell and J. A. H. Rubio and G. Q.
Barro",
title="Improving Barro},
title = {{Improving search through
diversity",
booktitle="National diversity}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-94)",
pages="1323-1328",
year=1994 (AAAI-94)},
pages = {1323-1328},
year = {1994},
}
@inproceedings{DFVBF,
author="W. author = {W. Zhang and R. E.
Korf",
title="Depth-first Korf},
title = {{Depth-first vs. best-first search: New
Results",
booktitle="National Results}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-93)",
pages="769-775",
year= 1993} (AAAI-93)},
pages = {769-775},
year = {1993},
}
@inproceedings{ILDS96,
author="R. E. Korf",
title="Improved limited discrepancy search",
booktitle="National Conference on Artificial Intelligence (AAAI-96)",
pages="286-291",
year= 1996}
@inproceedings{DBLP:conf/aaai/KorfS05,
author = {R. E.
Korf and
Peter Schultze}, Korf},
title =
{Large-Scale Parallel Breadth-First Search},
booktitle="National {{Improved limited discrepancy search}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-05)",
year = {2005}, (AAAI-96)},
pages =
{1380-1385},
bibsource {286-291},
year =
{DBLP, http://dblp.uni-trier.de} {1996},
}
@inproceedings{KORFAAAI05,
author="R. author = {R. E. Korf and P.
Schultze",
title="Large Schultze},
title = {{Large scale parallel breadth first
search",
booktitle="National search}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-05)",
pages="1380-1385",
year= 2005} (AAAI-05)},
pages = {1380-1385},
year = {2005},
}
@inproceedings{DBLDS97,
author="Toby Walsh",
title="Depth-bounded author = {Toby Walsh},
title = {{Depth-bounded discrepancy
search",
booktitle="International search}},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI-97)",
pages="1388-1393",
year= 1997} (IJCAI-97)},
pages = {1388-1393},
year = {1997},
}
@article{GEN59,
author="R. author = {R. Friedberg and B. Dunham and T.
North",
title="A North},
title = {{A learning
machine",
journal="IBM machine}},
journal = {IBM Journal of Research and
Development",
volume=3,
pages="282-287",
year=1959} Development},
volume = {3},
pages = {282-287},
year = {1959},
}
@article{SIM83,
author="S. author = {S. Kirkpatrick and C. D. Gelatt and M.
Vecshi",
title="Optimization Vecshi},
title = {{Optimization by simulated
annealing",
journal="Science",
volume=220,
pages="671-680",
year=1993} annealing}},
journal = {Science},
volume = {220},
pages = {671-680},
year = {1993},
}
@article{PDFS93,
author="V. author = {V. N. Rao and V.
Kumar",
title="On Kumar},
title = {{On the efficiency of parallel
backtracking",
journal="IEEE backtracking}},
journal = {IEEE Transactions on parallel and distributed
systems",
volume= 4,
pages="427-437",
year=1993} systems},
volume = {4},
pages = {427-437},
year = {1993},
}
@article{BFSMIN96,
author="R. author = {R. E. Korf and D. M.
Chickering",
title="Best-first Chickering},
title = {{Best-first minimax
search",
journal="Artificial intelligence",
volume= "84(1-2)",
pages="299-337",
year=1996} search}},
journal = {Artificial intelligence},
volume = {84(1-2)},
pages = {299-337},
year = {1996},
}
@article{JAIRPDB,
author="A. author = {A. Felner and R. E. Korf and S.
Hanan",
title="Additive Hanan},
title = {{Additive pattern database
heuristics",
journal="Journal heuristics}},
journal = {Journal of Artificial Intelligence
Research",
volume= 22,
pages="279-318", Research},
volume = {22},
pages = {279-318},
year =
2004 {2004},
}
@article{PHAJUR,
author="A. author = {A. Felner and R. Stern and A. Ben-Yair and S. Kraus and N.
Netanyahu",
title="PH{A}*: Netanyahu},
title = {{PH{A}*: Finding the Shortest Path with {A}* in Unknown Physical
Environments",
journal="Journal Environments}},
journal = {Journal of Artificial Intelligence
Research",
volume= 21,
pages="631-679",
year=2004 Research},
volume = {21},
pages = {631-679},
year = {2004},
}
@article{ROBOTS04,
author="W. author = {W. Burgard and M. Moors and C. Stachniss and F.
Schneider",
title="Coordinated Schneider},
title = {{Coordinated Multi-Robot
Exploration",
journal="IEEE Exploration}},
journal = {IEEE Transactions on
Robotics",
year=2005} Robotics},
year = {2005},
}
@inproceedings{CSABA2004,
author="C. Szepesvri",
title="Shortest author = {C. Szepesvri},
title = {{Shortest Path Discovery Problems: A Framework, Algorithms and Experimental
Results",
booktitle="National Results}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-04)",
pages="550-555",
year= 2004} (AAAI-04)},
pages = {550-555},
year = {2004},
}
@ARTICLE{Koen:03,
AUTHOR author =
"S. {S. Koenig and Y. Smirnov and C.
Tovey",
TITLE Tovey},
title =
"Performance {{Performance Bounds for Planning in Unknown
Terrain",
JOURNAL Terrain}},
journal =
"Artificial {Artificial Intelligence
Journal",
VOLUME Journal},
volume = {147},
number =
"147",
NUMBER= "1-2",
PAGES {1-2},
pages =
"253-279",
YEAR {253-279},
year =
"2003" {2003},
}
@article{LPJUR,
author="A. author = {A. Felner and Y. Shoshani and Yaniv Altshuler and F.
Bruckstein",
title="Multi-agent Bruckstein},
title = {{Multi-agent Physical {A}* with Large
Pheromones",
journal="Journal Pheromones}},
journal = {Journal of Autonomous Agents and Multi-Agent
Systems",
volume= "12(1)",
pages="3-34",
year="2006" Systems},
volume = {12(1)},
pages = {3-34},
year = {2006},
}
@inproceedings{FASTR2001,
author="R. author = {R. E. Korf and W.
Zhang",
title="Divide-and-conquer Zhang},
title = {{Divide-and-conquer frontier search applied to optimal sequence
alignment,",
booktitle="National Conference on Artificial Intelligence (AAAI-00)",
pages="910-916",
year= 2000}
@inproceedings{DBLP:conf/ijcai/StickelT85,
author = {Mark E. Stickel and
Mabry Tyson},
title alignment,}},
booktitle =
{An Analysis of Consecutively Bounded Depth-First Search
with Applications in Automated Deduction},
booktitle="International Joint {National Conference on Artificial Intelligence
(IJCAI-85)",
year = {1985}, (AAAI-00)},
pages =
{1073-1075},
bibsource {910-916},
year =
{DBLP, http://dblp.uni-trier.de} {2000},
}
@article{reve,
author="A. author = {A. van de
Liefvoort",
title="An Liefvoort},
title = {{An iterative algorithm for the {R}eve's
Puzzle",
journal="The Puzzle}},
journal = {The Computer
Journal",
volume= "35(1)", Journal},
volume = {35(1)},
pages =
"91-`92",
year=1992 {91-`92},
year = {1992},
}
@article{GM83,
author="D. author = {D. S.
Nau",
title="Pathology Nau},
title = {{Pathology on game trees revisited, and an alternative to
minimaxing",
journal="Artificial intelligence",
volume= "21(1-2)", minimaxing}},
journal = {Artificial intelligence},
volume = {21(1-2)},
pages =
"221-144",
year=1983 {221-144},
year = {1983},
}
@inproceedings{KORAAAI00,
author="R. author = {R. E.
Korf",
title="Recent Korf},
title = {{Recent progress in the design and analysis of admissible heuristic
functions",
booktitle="National functions}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-00)",
pages="1165-1170",
year=2000} (AAAI-00)},
pages = {1165-1170},
year = {2000},
}
@article{KEN2007,
author="K. author = {K. Anderson and J. Schaeffer and R. C.
Holte",
title="Partial Holte},
title = {{Partial Pattern
Databases",
journal="SARA-07",
pages="128-129",
year=2007} Databases}},
journal = {SARA-07},
pages = {128-129},
year = {2007},
}
@article{ALBE75,
author="D. author = {D. E. Knuth and R. E.
Moore ",
title="An Moore},
title = {{An analysis of alpha-beta
pruning",
journal="Artificial Intelligence",
volume= 6,
pages="293-326",
year=1975} pruning}},
journal = {Artificial Intelligence},
volume = {6},
pages = {293-326},
year = {1975},
}
@article{PRA95,
author="M. author = {M. Evett and J. Hendler and A. Mahanti and D.S.
Nau",
title="{PRA}*: Nau},
title = {{{PRA}*: Massively Parallel Heuristic
Search",
journal="Journal Search}},
journal = {Journal of Parallel and Distributed
Computing",
volume= "25(2)",
pages="92-103",
year=1995} Computing},
volume = {25(2)},
pages = {92-103},
year = {1995},
}
@article{PIDA91,
author="C. author = {C. Powley and R. E.
Korf",
title="Single-agent Korf},
title = {{Single-agent parallel window
search",
journal="IEEE search}},
journal = {IEEE Transactions on Pattern Analysis and Machine
Intelligence",
volume=13,
number=5,
pages="466-477",
year=1991} Intelligence},
volume = {13},
number = {5},
pages = {466-477},
year = {1991},
}
@article{IDPS91,
author="A. author = {A. Mahanti and C. J.
Daniels",
title="A Daniels},
title = {{A SIMD approach to parallel heuristic
search",
journal="Artificial Intelligence",
volume="60(2)",
pages="243-282",
year=1993} search}},
journal = {Artificial Intelligence},
volume = {60(2)},
pages = {243-282},
year = {1993},
}
@inproceedings{ILDFS97,
author="Pedro Meseguer",
title="Interleaved author = {Pedro Meseguer},
title = {{Interleaved Depth-First
Search ",
booktitle="International Search}},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI-97)",
pages="1382-1387 ",
year=1997} (IJCAI-97)},
pages = {1382-1387},
year = {1997},
}
@article{HANS92,
author="O. author = {O. Hansson and A. Mayer and M.
Yung",
title="Criticizing Yung},
title = {{Criticizing solutions to relaxed models yields powerful admissible
heuristics",
journal="Information Sciences",
volume="63(3)",
pages="207-227",
year=1992} heuristics}},
journal = {Information Sciences},
volume = {63(3)},
pages = {207-227},
year = {1992},
}
@article{BFID85,
author = {R. E. Korf},
title =
{Depth-First {{Depth-First Iterative-Deepening: An Optimal Admissible Tree
Search}, Search}},
journal = {Artificial Intelligence},
volume = {27},
number = {1},
year = {1985},
pages = {97-109},
bibsource = {DBLP,
http://dblp.uni-trier.de} http://dblp.uni-trier.de},
}
@inproceedings{KOR94,
author="R. author = {R. E. Korf and W.
Zhang",
title=" Incremental Zhang},
title = {{Incremental random search
trees",
booktitle="AAAI-94 trees}},
booktitle = {AAAI-94 Workshop on Experimental Evaluation of Reasoning and Search
Methods ",
pages="15-18",
year= 1994 Methods},
pages = {15-18},
year = {1994},
}
@inproceedings{KOR97,
author="R. author = {R. E.
Korf",
title="Finding Korf},
title = {{Finding optimal solutions to {R}ubik's Cube using pattern
databases",
booktitle="National databases}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-97)",
pages="700-705",
year= 1997 (AAAI-97)},
pages = {700-705},
year = {1997},
}
@inproceedings{KOR294,
author="R. author = {R. E. Korf and J.
Pemberton",
title= "Incremental Pemberton},
title = {{Incremental search algorithms for real-time decision
making",
booktitle="International making}},
booktitle = {International Conference on
Planning",
pages="140-145",
year= 1994 Planning},
pages = {140-145},
year = {1994},
}
@inproceedings{PUZ1566,
author="J. author = {J. E. Doran and D.
Michie",
title= "Experiments Michie},
title = {{Experiments with the graph traverser
program",
booktitle="Proceedings program}},
booktitle = {Proceedings of the Royal Society
A",
pages="235-259",
volume=294,
year= 1966} A},
pages = {235-259},
volume = {294},
year = {1966},
}
@article{PUZ15A89,
author="H. author = {H. W. Davis and A. Bramanti-Gregor and J.
Wang",
title="The Wang},
title = {{The advantages of using depth and breadth components in heuristic
search ",
journal="Methodologies search}},
journal = {Methodologies for Intelligent systems
3",
editor= "Z.W. 3},
editor = {Z.W. Ras and L.
Saitta",
pages="19-28",
year=1989 Saitta},
pages = {19-28},
year = {1989},
}
@inproceedings{NPC86,
author = {D. Ratner and M. Warrnuth},
title =
{Finding {{Finding a Shortest Solution for the {N $\times$ N} Extension of the 15-PUZZLE Is
Intractable},
booktitle="AAAI-86", Intractable}},
booktitle = {AAAI-86},
year = {1986},
pages =
{168-172} {168-172},
}
@inproceedings{MREC89,
author="A. author = {A. Sen and A.
Bagchi",
title="Fast Bagchi},
title = {{Fast recursive formulations for best-first search that allow controlled use of
memory",
booktitle="International memory}},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI-89)",
pages="297-302",
year= 1989 (IJCAI-89)},
pages = {297-302},
year = {1989},
}
@mastersthesis{Bir93,
author="L. Biran",
title="The author = {L. Biran},
title = {{The Parallel State Execution
Model",
school="Department Model}},
school = {Department of Mathematics, Bar-Ilan
university",
address="Israel",
year=1993} university},
address = {Israel},
year = {1993},
}
@article{RBFS93,
author="R. author = {R. E.
Korf",
title=" Linear-space Korf},
title = {{Linear-space best-first
search",
journal="Artificial Intelligence",
volume="62(1)",
pages="41-78",
year= 1993} search}},
journal = {Artificial Intelligence},
volume = {62(1)},
pages = {41-78},
year = {1993},
}
@article{KOR95,
author="W. author = {W. Zhang and R. E.
Korf",
title="Performance Korf},
title = {{Performance of linear-space search
algorithms",
journal="Artificial Intelligence ",
volume=79,
pages="241-292 ",
year= 1995} algorithms}},
journal = {Artificial Intelligence},
volume = {79},
pages = {241-292},
year = {1995},
}
@article{BSTR79,
author="H. author = {H. J.
Berliner",
title="The Berliner},
title = {{The B* tree search algorithm: A best-first proof
procedure",
journal=" Artificial Intelligence",
volume=12,
pages="23-40",
year=1979}
@book{garey+johnson,
author="Garey, M.R. and D.S. Johnson",
title="Computers and
Intractability: A Guide to the Theory of NP-Completeness",
publisher="W.H. Freeman",
address="New York",
year=1979} procedure}},
journal = {Artificial Intelligence},
volume = {12},
pages = {23-40},
year = {1979},
}
@book{papadimitriou,
author="C. author = {C. H. Papadimitriou and K.
Steiglitz",
title="Combinatorial Steiglitz},
title = {{Combinatorial Optimization: Algorithms and
Complexity",
publisher="Prentice-Hall",
address="Englewood Complexity}},
publisher = {Prentice-Hall},
address = {Englewood Cliffs,
N.J.",
year=1982} N.J.},
year = {1982},
}
@book{SCOUTSTR84,
author="J. Pearl",
title="Heuristics",
publisher="Addison-Wesley",
address="Reading Mass",
year=1984}
@article {hansson,
author = "O. author = {J. Pearl},
title = {{Heuristics}},
publisher = {Addison-Wesley},
address = {Reading Mass},
year = {1984},
}
@article{hansson,
author = {O. Hansson and A. Mayer and M.
Yung", Yung},
title =
"Criticizing {{Criticizing solutions to relaxed models yields powerful admissible
heuristics", heuristics}},
journal =
"Information Sciences", {Information Sciences},
volume =
"63", {63},
number =
"3", {3},
year =
"1992", {1992},
pages =
"207-227"}
@article {analysis, {207-227},
}
@article{analysis,
author =
"R. {R. E. Korf and M. Reid and S.
Edelkamp", Edelkamp},
title =
"Time {{Time complexity of
Iterative-Deepening-{A}*", Iterative-Deepening-{A}*}},
journal =
"Artificial Intelligence", {Artificial Intelligence},
volume =
"129", {129},
number =
"1-2", {1-2},
year =
"2001", {2001},
pages =
"199-218"} {199-218},
}
@inproceedings{ijcai99,
author="R. author = {R. E.
Korf",
title="Divide-and-conquer Korf},
title = {{Divide-and-conquer bidirectional search: First
results",
booktitle="International results}},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI-99)",
pages="1184-1189",
year= "1999" (IJCAI-99)},
pages = {1184-1189},
year = {1999},
}
@article{SSSTR79,
author="G. Stockman",
title="A author = {G. Stockman},
title = {{A minimax algorithm better than
alpha-beta?",
journal="Artificial Intelligence",
volume=12,
pages="179-196",
year=1979} alpha-beta?}},
journal = {Artificial Intelligence},
volume = {12},
pages = {179-196},
year = {1979},
}
@article{TABU89,
author="F. Glover",
title="Tabu search",
journal="ORSA author = {F. Glover},
title = {{Tabu search}},
journal = {ORSA Journal of computing
1(3)",
pages="190-206",
year=1989} 1(3)},
pages = {190-206},
year = {1989},
}
@article{IE92,
author="S. author = {S. J.
Russell",
title="Efficient Russell},
title = {{Efficient memory-bounded search
methods",
journal="Proc methods}},
journal = {Proc of
ECAI-92",
year= 1992 ECAI-92},
year = {1992},
}
@article{KAINDL97,
author="H. author = {H. Kaindl and G.
Kainz",
title="Bidirectional Kainz},
title = {{Bidirectional heuristic search
reconsidered",
journal="Journal reconsidered}},
journal = {Journal of Artificial Intelligence
Research",
volume=7,
pages="283-317",
year= 1997} Research},
volume = {7},
pages = {283-317},
year = {1997},
}
@article{KAINDL97short,
author="H. author = {H. Kaindl and G.
Kainz",
title="Bidirectional Kainz},
title = {{Bidirectional heuristic search
reconsidered",
journal="Journal reconsidered}},
journal = {Journal of Artificial Intelligence
Research",
volume=7,
pages="283-317",
year= 1997} Research},
volume = {7},
pages = {283-317},
year = {1997},
}
@inproceedings{SMASTR94,
author="H. author = {H. Kaindl and A.
Khorsand",
title="Memory-bounded Khorsand},
title = {{Memory-bounded bidirectional
search",
booktitle="National search}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-94)",
pages="1359-1364",
year= 1994} (AAAI-94)},
pages = {1359-1364},
year = {1994},
}
@article{MASTR89,
author="P. author = {P. P. Chakrabarti and S. Ghose and A. Acharya and S. C. de
Sarkar",
title=" Heuristic Sarkar},
title = {{Heuristic search in restricted
memory",
journal="Artificial Intelligence",
volume="41(2)",
pages="197-221",
year= 1989} memory}},
journal = {Artificial Intelligence},
volume = {41(2)},
pages = {197-221},
year = {1989},
}
@article{HuynDechterPearlAIJ,
author = {Nam Huyn and Rina Dechter and Judea Pearl},
title =
{Probabilistic {{Probabilistic Analysis of the Complexity of
{A}*}, {A}*}},
journal = {Artificial Intelligence},
volume = {15},
number = {3},
year = {1980},
pages = {241-254},
bibsource = {DBLP,
http://dblp.uni-trier.de} http://dblp.uni-trier.de},
}
@article{SenBagchiZhangAIJ,
author="Anup author = {Anup K. Sen and A. Bagchi and Weixiong
Zhang",
title="Average-case Zhang},
title = {{Average-case analysis of best-first search in two representative directed acyclic
graphs",
journal="Artificial Intelligence",
volume="155(1-2)",
pages="183-206",
year= 2004} graphs}},
journal = {Artificial Intelligence},
volume = {155(1-2)},
pages = {183-206},
year = {2004},
}
@article{MYMSCTHESIS,
author="A. Felner",
title="Searching author = {A. Felner},
title = {{Searching for alternative plan, {MSc}
thesis",
journal="Department thesis}},
journal = {Department of Computer Science, Hebrew University,
Jerusalem, Jerusalem Israel,available at
http://www.cs.biu.ac.il/\~felner",
year=1995} http://www.cs.biu.ac.il/\~felner},
year = {1995},
}
@inproceedings{Stephen91,
author = {Stephen V. Chenoweth and Henry W. Davis},
title =
{High-Performance {{High-Performance {A}* Search Using Rapidly Growing
Heuristics},
booktitle="International Heuristics}},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI-91)", (IJCAI-91)},
year = {1991},
pages = {198-203},
bibsource = {DBLP,
http://dblp.uni-trier.de} http://dblp.uni-trier.de},
}
@phdthesis{Gaschnig79,
author="J. Gaschnig",
title="Performance author = {J. Gaschnig},
title = {{Performance Measurement and Analysis of Certain Search Algorithms. Ph.D.
Dissertation",
school="Carnegie-Mellon University",
address="",
year=1979} Dissertation}},
school = {Carnegie-Mellon University},
address = {},
year = {1979},
}
@phdthesis{FELNER02,
author="A. Felner",
title="Improving author = {A. Felner},
title = {{Improving search techniques and using them on different environments, {Ph.D}
thesis",
school="Department thesis}},
school = {Department of Computer Science, Bar-Ilan
University",
address="Ramat-Gan, University},
address = {Ramat-Gan, Israel, available at
http://www.ise.bgu.ac.il/facutly/felner",
year=2002} http://www.ise.bgu.ac.il/facutly/felner},
year = {2002},
}
@phdthesis{WASTR79,
author="J. Gasching",
title="Performance author = {J. Gasching},
title = {{Performance measurement and analysis of certain search
algorithms",
school="Department algorithms}},
school = {Department of Computer Science, Carnegie-Mellon
University",
address="Pittsburgh Pa",
year=1979} University},
address = {Pittsburgh Pa},
year = {1979},
}
@article{WASTR89,
author="H. author = {H. W. Davis and A. Bramanti-Gregor and J.
Wang",
title="The Wang},
title = {{The advantages of using depth and breadth components in heuristic
search ",
journal="Methodologies search}},
journal = {Methodologies for Intelligent systems
3",
editor= "Z.W. 3},
editor = {Z.W. Ras and L.
Saitta",
pages="19-28",
year=1989,
address="North-Holland, Amsterdam"} Saitta},
pages = {19-28},
year = {1989},
address = {North-Holland, Amsterdam},
}
@techreport{Den73,
author="J. author = {J. B.
Dennis",
title="First Dennis},
title = {{First Version of a Data-flow Procedure
Language",
institution="MIT Language}},
institution = {MIT lab. for Computer
Science",
address="Cambridge, Science},
address = {Cambridge, MA
02139",
journal="MAC 02139},
journal = {MAC Technical
Memorandum",
number=61,
month="August",
year=1973} Memorandum},
number = {61},
month = {August},
year = {1973},
}
@article{WASTR70,
author="Ira Pohl",
title= "Heuristic author = {Ira Pohl},
title = {{Heuristic search viewed as path finding in a
graph",
journal="Artificial Intelligence",
volume=1,
pages="193-204",
year= 1970} graph}},
journal = {Artificial Intelligence},
volume = {1},
pages = {193-204},
year = {1970},
}
@inproceedings{WASTR73,
author="Ira Pohl",
title="The author = {Ira Pohl},
title = {{The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem
solving",
booktitle="International solving}},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI-73)",
pages="12-17",
year= 1973 (IJCAI-73)},
pages = {12-17},
year = {1973},
}
@inproceedings{SCHOP87,
author="M. author = {M. J.
Schopers",
title="Universal Schopers},
title = {{Universal plans for reactive robots in unpredictable
environments.",
booktitle="International environments.}},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI-87)",
pages="1039-1046",
year= 1987 (IJCAI-87)},
pages = {1039-1046},
year = {1987},
}
@inproceedings{PENGI87,
author="P. author = {P. E. Agre and D.
Chapman",
title="Pengi: Chapman},
title = {{Pengi: an implementation of a theory of
activity",
booktitle="International activity}},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI-87)",
pages="268-272",
year= 1987 (IJCAI-87)},
pages = {268-272},
year = {1987},
}
@article{PLANEX72,
author="R. author = {R. E. Fikes, P. E. Hart and N. J.
Nilsson",
title= " Learning Nilsson},
title = {{Learning and executing generalized robot
plans.",
journal= "Artificial Intelligence",
volume="3(4)",
pages="189-208",
year= 1972} plans.}},
journal = {Artificial Intelligence},
volume = {3(4)},
pages = {189-208},
year = {1972},
}
@article{NASL78,
author="D. McDermott",
title= "Planning and acting",
journal= "Cognitive Science",
volume="2(2)",
pages="72-109",
year= 1978} author = {D. McDermott},
title = {{Planning and acting}},
journal = {Cognitive Science},
volume = {2(2)},
pages = {72-109},
year = {1978},
}
@article{PAT96,
author="J. author = {J. C. Cullberson and J.
Schaeffer",
title= "Pattern databases",
journal= "Computational Intelligence",
volume="14(3)",
pages="318-334",
year= 1998} Schaeffer},
title = {{Pattern databases}},
journal = {Computational Intelligence},
volume = {14(3)},
pages = {318-334},
year = {1998},
}
@inproceedings{IPEM88,
author="J. author = {J. Ambros-Ingerson and S.
Steel",
title="Integrating Steel},
title = {{Integrating planning, execution and
monitoring.",
booktitle="National monitoring.}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-88)",
pages="735-740",
year= 1988 (AAAI-88)},
pages = {735-740},
year = {1988},
}
@article{GINSB89,
author="M. author = {M. L.
Ginsberg",
title= "Universal Ginsberg},
title = {{Universal Planning: an (almost) universally bad
idea",
journal="AI Magazine",
volume="10(4)",
pages="40-44",
year= 1987} idea}},
journal = {AI Magazine},
volume = {10(4)},
pages = {40-44},
year = {1987},
}
@article{STRIPS71,
author="R. author = {R. E. Fikes and N. J.
Nilsson",
title= "STRIPS: Nilsson},
title = {{STRIPS: a new approach to the application of theorem proving to problem
solving",
journal="Artificial Intelligence",
volume="2(3-4)",
pages="189-208",
year= 1971}
@inproceedings {ETZ92,
author="O. solving}},
journal = {Artificial Intelligence},
volume = {2(3-4)},
pages = {189-208},
year = {1971},
}
@inproceedings{ETZ92,
author = {O. and S. Hanks and D. Weld and D. Draper and N. Leash and M.
Williamson",
title= "An Williamson},
title = {{An approach to planning with incomplete
information",
booktitle= "International information}},
booktitle = {International Conference on Principles of Knowledge Representation and
Reasoning",
year= 1993} Reasoning},
year = {1993},
}
@article{EITAN93,
author="Eithan author = {Eithan Ephrati and Jeffrey S.
Rosenschein",
title= "Planning Rosenschein},
title = {{Planning to Please: Following Another Agent's Intended
Plan",
journal="Group Plan}},
journal = {Group Decision and
Negotiation",
volume=2,
number=3,
pages="219-235",
year= 1993} Negotiation},
volume = {2},
number = {3},
pages = {219-235},
year = {1993},
}
@article{REPL191,
author="Martha Pollack",
title= "Overloading author = {Martha Pollack},
title = {{Overloading Intention for Efficient Practical
Reasoning",
journal="Nous",
volume="25",
number="4",
pages="513-536",
year= 1991} Reasoning}},
journal = {Nous},
volume = {25},
number = {4},
pages = {513-536},
year = {1991},
}
@article{REPL392,
author="Subbarao Kambhampati",
title= "A author = {Subbarao Kambhampati},
title = {{A validation structured base theory of plan modification and
reuse",
journal="Artificial Intelligence",
volume="55(2-3)",
pages="1-64",
year= 1992} reuse}},
journal = {Artificial Intelligence},
volume = {55(2-3)},
pages = {1-64},
year = {1992},
}
@article{REPL295,
author="Bernhard author = {Bernhard Nebel and Jana
Koehler",
title= "Plan Koehler},
title = {{Plan Reuse versus Plan
Generation",
journal=" Artificial Intelligence",
volume=84,
year= 1995} Generation}},
journal = {Artificial Intelligence},
volume = {84},
year = {1995},
}
@article{PS95,
author="J. author = {J. F. Dillenburg and P. C.
Nelson",
title= "Perimeter Search",
journal="Artificial Intelligence",
volume=65,
pages="165-178",
year= 1994} Nelson},
title = {{Perimeter Search}},
journal = {Artificial Intelligence},
volume = {65},
pages = {165-178},
year = {1994},
}
@article{BIDA96,
author="G. Manzini",
title= "{BIDA}*: author = {G. Manzini},
title = {{{BIDA}*: an improved perimeter search
algorithm",
journal= "Artificial Intelligence",
volume=75,
pages="347-360",
year= 1995} algorithm}},
journal = {Artificial Intelligence},
volume = {75},
pages = {347-360},
year = {1995},
}
@article{ARG99,
author="S. author = {S. Argamon-Engelson and S. Kraus and S.
Sina",
title= "Interleaved Sina},
title = {{Interleaved vs. A Priori Exploration for Repeated Navigation in a Partially-Known
Graph",
journal= "International Graph}},
journal = {International Journal of Pattern Recognition and Artificial
Intelligence",
volume="13(7)",
pages="963-968",
year="1999"} Intelligence},
volume = {13(7)},
pages = {963-968},
year = {1999},
}
@article{ARG98,
author="S. author = {S. Argamon-Engelson and S. Kraus and S.
Sina",
title= "Utility-Based Sina},
title = {{Utility-Based On-Line Exploration for Repeated Navigation in an Embedded
Graph",
journal="Artificial Intelligence",
volume="101(1-2)",
pages="967-984",
year="1998"} Graph}},
journal = {Artificial Intelligence},
volume = {101(1-2)},
pages = {967-984},
year = {1998},
}
@article{PARTY,
author="R. author = {R. Preis and R.
Diekmann",
title= "{PARTY} Diekmann},
title = {{{PARTY} - a software library for graph
partitioning",
journal="Technical Report",
address="University partitioning}},
journal = {Technical Report},
address = {University of
Paderborn",
year="1997"} Paderborn},
year = {1997},
}
@article{SCOTCH,
author="F. author = {F. Pellgrini and J.
Roman",
title= "{SCOTCH}: Roman},
title = {{{SCOTCH}: a software package for static mapping by dual recursive bipartitioning of process and architecture
graphs",
journal="HPCN-Europe, graphs}},
journal = {HPCN-Europe, Springer LNCS
1067",
pages="493-498",
year="1996"} 1067},
pages = {493-498},
year = {1996},
}
@article{METIS,
author="G. author = {G. Karypis and V.
Kumar",
title= "A Kumar},
title = {{A fast and high quality multilevel scheme for partitioning irregular
graphs",
journal="Technical Report",
volume="95-035",
address="Dept. graphs}},
journal = {Technical Report},
volume = {95-035},
address = {Dept. Computer Science, Univ. Minnesota, Minneapolis,
MN",
year="1995"} MN},
year = {1995},
}
@article{CHACO,
author="B. author = {B. Hendrickson and R.
Leland",
title= "The Leland},
title = {{The chaco user's
guide",
journal="Technical Report",
volume="SAND94-2692",
address="Sandia guide}},
journal = {Technical Report},
volume = {SAND94-2692},
address = {Sandia National
Laboratories",
year="1994"} Laboratories},
year = {1994},
}
@article{JOSTLE,
author="C. Walshaw",
title= "Parallel author = {C. Walshaw},
title = {{Parallel {JOSTLE}
userguide",
journal="Technical Report",
address="University userguide}},
journal = {Technical Report},
address = {University of Greenwich, London
,UK",
year="1998"} ,UK},
year = {1998},
}
@article{KL70,
author="B. author = {B. Kernigham and S.
Lin",
title= "An Lin},
title = {{An Efficient Heiristic Procedure for Partitioning
graphs.",
journal="Bell graphs.}},
journal = {Bell Systems Technical
J.",
volume=49,
pages="291-307",
year="1970"} J.},
volume = {49},
pages = {291-307},
year = {1970},
}
@article{GPPSA89,
author="D. author = {D. S. Johnson and C. R. Aragon and L. A. McGeoch and C.
Schevon",
title= "Optimization Schevon},
title = {{Optimization by Simulated Allealing: An Experimental Evaluation; Part 1, Graph
Partitioning.",
journal="Operations Research",
volume=37,
pages="121-133",
year="1989"} Partitioning.}},
journal = {Operations Research},
volume = {37},
pages = {121-133},
year = {1989},
}
@article{KK99,
author="K. author = {K. Schloegel and G. Karypis and V.
Kumar",
title= "Graph Kumar},
title = {{Graph Partitioning for High Performance Scientific
Simulations.",
journal="CRPC Simulations.}},
journal = {CRPC Parallel Computing
Handbook",
publisher="Morgan Kaufmann",
year="2000", Handbook},
publisher = {Morgan Kaufmann},
year = {2000},
}
@article{GPPNPHARD,
author="M. author = {M. Garey and D. Johnson and L.
Stockmeyer",
title= "Some Stockmeyer},
title = {{Some simplefied NP-complete graph
problems",
journal="Theort. problems}},
journal = {Theort. Comput.
Sci.",
volume="1",
pages="237-267",
year="1976"} Sci.},
volume = {1},
pages = {237-267},
year = {1976},
}
@article{SOKOBAN,
author="A. author = {A. Junghanns and J.
Schaeffer",
title= "Sokoban: Schaeffer},
title = {{Sokoban: Enhancing general single-agent search methods using domain
knowledge.",
journal="Artificial Intelligence",
volume="129",
pages="219-251",
year="2001"} knowledge.}},
journal = {Artificial Intelligence},
volume = {129},
pages = {219-251},
year = {2001},
}
@article{GPPGA96,
author="T. author = {T. N. Bui and B. R.
Moon",
title= "Genetic Moon},
title = {{Genetic algorithm and Graph
Partitioning.",
journal="IEEE Partitioning.}},
journal = {IEEE Transactions On
Computers",
volume="45(7)",
pages="87-101",
year="1996"} Computers},
volume = {45(7)},
pages = {87-101},
year = {1996},
}
@article{GPPLA96,
author="J. author = {J. B. Oommen and E. V. de St.
Croix",
title= "Graph Croix},
title = {{Graph Partitioning using learning
Automata.",
journal="IEEE Automata.}},
journal = {IEEE Transactions On
Computers",
volume="45(2)",
pages="195-208",
year="1995"} Computers},
volume = {45(2)},
pages = {195-208},
year = {1995},
}
@article{GPPXLS91,
author="H. author = {H. Pirkul and E
Rolland",
title= "New Rolland},
title = {{New Heuristic Solution Procedures for the Uniform Graph Partitioning
Problem",
journal="Computers Problem}},
journal = {Computers and Operations
research",
year="1991"} research},
year = {1991},
}
@article{LGG99,
author="E. author = {E. Rolland and H.
Pirkul",
title= "A Pirkul},
title = {{A Lagrangian Based Heuristic for Uniform Graph
Partitioning",
journal="Computers Partitioning}},
journal = {Computers and Operations
research",
pages="87-99",
year="1999"} research},
pages = {87-99},
year = {1999},
}
@book{NPC79,
author="M. author = {M. R. Garey and D. S.
Johnson",
title= "Computers Johnson},
title = {{Computers and Intractability: A Guide to the Theory of
{NP}-Completeness", {NP}-Completeness}},
publisher =
"W. {W. H.
Freeman", Freeman},
address =
"San {San Francisco,
CA",
year="1979"} CA},
year = {1979},
}
@article{VCAPP97,
author="P. author = {P. Crecenzi and V.
Kann",
title= "A Kann},
title = {{A compendium of {NP} optimization
problems",
journal="Available problems}},
journal = {Available at
http://www.nada.kth.se/theory/problemlist.html",
year="1997"} http://www.nada.kth.se/theory/problemlist.html},
year = {1997},
}
@article{BUSS93,
author="J. author = {J. F. Buss and J.
Goldsmith",
title= "Nondetermenisim Goldsmith},
title = {{Nondetermenisim within
{P}",
journal="SIAM {P}}},
journal = {SIAM J,
Comput.",
volume=22,
pages="560-572",
year="1993"} Comput.},
volume = {22},
pages = {560-572},
year = {1993},
}
@article{DOW95,
author="R. author = {R. G. Downey and M. R.
Fellows",
title= "Parameterized Fellows},
title = {{Parameterized Computational
feasibility",
journal="P. feasibility}},
journal = {P. Clote, J. Remmel (Eds.), Feasible
Mathematics",
volume=2,
pages="219-244",
year="1995",
address="Birkhauser, Mathematics},
volume = {2},
pages = {219-244},
year = {1995},
address = {Birkhauser, Boston
Ma."} Ma.},
}
@article{PAP96,
author="C. author = {C. H. Papadimitriou and M.
Yannakakis",
title= "On Yannakakis},
title = {{On limited nondeterminism and the complexity of the
{V-C}
dimention",
journal="J. Comput. System Sci",
volume=53,
pages="161-170",
year="1996",} {V-C}},
}
@article{BAL98,
author="R. author = {R. Balasubramanian and M. R. Fellows and V.
Raman",
title= "An Raman},
title = {{An improved fixed-parameter algorithm for vertex
cover",
journal="Information cover}},
journal = {Information Processing
Letters",
volume="65(3)",
pages="163-168",
year="1998"} Letters},
volume = {65(3)},
pages = {163-168},
year = {1998},
}
@article{DOW99,
author="R. author = {R. G. Downey and M. R. Fellows and U.
Stege",
title= "Parameterized Stege},
title = {{Parameterized Complexity: A framework for systematically conforting computational
intractability",
journal="DIMACS intractability}},
journal = {DIMACS Series in Discrete Mathematics and Theoretical Computer
Science",
volume=49,
year="1999"} Science},
volume = {49},
year = {1999},
}
@techreport{QHULL,
author="C. author = {C. B. Barber and D. P. Dobkin and H.
Huhdanpaa",
title= "The Huhdanpaa},
title = {{The {Q}uickhull algorithm for convex
hull",
institution= "Geometry hull}},
institution = {Geometry Center Technical Report
GCG53",
address= "University GCG53},
address = {University of
Minnesota",
year="1993"} Minnesota},
year = {1993},
}
@book{DEL92,
author="A. author = {A. Okabe and B. Boots and K.
Sugihara",
title= "Spatial Sugihara},
title = {{Spatial Tessellations, Concepts, and Applications of {V}oronoi
Diagrams",
publisher="Wiley, Chichester",
address="UK",
year="1992"} Diagrams}},
publisher = {Wiley, Chichester},
address = {UK},
year = {1992},
}
@Article{CLIQUES,
author="Johnson author = {Johnson and Trick
Eds",
title="Cliques, Eds},
title = {{Cliques, Coloring and
Satisfiability",
journal="DIMACS Satisfiability}},
journal = {DIMACS series in Discrete Math. and Theoretical
CS", CS},
volume =
"26", {26},
year =
"1999", {1999},
}
@Article{NIED99,
author="R. author = {R. Niedermeier and P.
Rossmanith",
title="Upper Rossmanith},
title = {{Upper Bounds for Vertex Cover Further
Improved",
journal="Lecture Improved}},
journal = {Lecture Notes in Computer
Science", Science},
volume =
"1563", {1563},
pages =
"561-570", {561-570},
year =
"1999", {1999},
}
@Article{Cheetham03,
author="J. author = {J. Cheetham and F. Dehne and A. Rau-Chaplin and U. Stege and P. J.
Taillon",
title="Solving Taillon},
title = {{Solving Large FPT Problems On Coarse Grained Parallel
Machines",
journal="Journal Machines}},
journal = {Journal of Computer and System
Sciences", Sciences},
year =
"To appear", {To appear},
}
@Article{JUNGER98,
author="M. author = {M. Jnger and S.
Thienel",
title="Introduction Thienel},
title = {{Introduction to ABACUS - A Branch-and-CUt
System",
journal="Operations System}},
journal = {Operations Research Letters,
22(263)", 22(263)},
pages =
"83-95", {83-95},
year =
"1998", {1998},
}
@Article{CAPRARA97,
author="A. author = {A. Caprara and M.
Fischetti",
title="Branch Fischetti},
title = {{Branch and ut
algorithms",
journal="M. algorithms}},
journal = {M. Dell'Amico et al. (eds.) Annotated bibliographies in combinatorial optimization,
Wiley", Wiley},
pages =
"45-64", {45-64},
year =
"1997", {1997},
}
@Article{CHEN2001,
author="J. author = {J. Chen and I. Kanj and W.
Jia",
title="Vertex Jia},
title = {{Vertex cover: further observations and further
improvements",
journal="Journal improvements}},
journal = {Journal of
Algorithms", Algorithms},
volume =
41, {41},
pages =
"280-301", {280-301},
year =
"2001", {2001},
}
@Article{CHEN99,
author="J. author = {J. Chen and I. Kanj and W.
Jia",
title="Vertex Jia},
title = {{Vertex cover: further observations and further
improvements",
journal="Lecture improvements}},
journal = {Lecture Notes in Computer
Science", Science},
volume =
1665, {1665},
pages =
"313-324", {313-324},
year =
"1999", {1999},
}
@Article{CKK97,
author =
"R. {R. E.
Korf", Korf},
title =
"A {{A complete anytime algorithm for number
partitioning,", partitioning,}},
journal =
"Aritificial Intelligence",
volume= "106(2)",
pages= "181-203", {Aritificial Intelligence},
volume = {106(2)},
pages = {181-203},
year =
"1998", {1998},
}
@Article{KK82,
author =
"N. {N. Karmarkar and R. M.
Karp", Karp},
title =
"The {{The differencing method of set
partitioning.", partitioning.}},
journal =
"Technical {Technical Report, UCB/CSD
82/113",
address= "Computer 82/113},
address = {Computer Sceince Division, University of
California, California Berkeley,
Ca", Ca},
year =
"1982", {1982},
}
@ARTICLE{BELLMAN,
author =
"R. Bellman", {R. Bellman},
title =
"On {{On a routing
problem", problem}},
journal =
"Quarterly {Quarterly of Applied
Mathematics", Mathematics},
year =
"1958", {1958},
volume =
"16", {16},
number =
"1", {1},
pages =
"87-90", {87-90},
}
@inproceedings{bender98power,
author =
"M. {M. A. Bender and A. Fernandez and D. Ron and A. Sahai and S. P.
Vadhan", Vadhan},
title =
"The {{The Power of a Pebble: {E}xploring and Mapping Directed
Graphs", Graphs}},
booktitle =
"{ACM} {{ACM} Symposium on the Theory of
Computing", Computing},
pages =
"269-278", {269-278},
month =
"May", {May},
year =
"1998", {1998},
address =
"Dallas, Texas", {Dallas, Texas},
url =
"citeseer.nj.nec.com/bender98power.html" {citeseer.nj.nec.com/bender98power.html},
}
@ARTICLE{CUCKA,
author =
"P. {P. Cucka and N. S. Netanyahu and A.
Rosenfeld", Rosenfeld},
title =
"Learning {{Learning in Navigation: {G}oal finding in
graphs", graphs}},
journal =
"International {International Journal of Pattern Recognition and Artificial
Intelligence",
volume = "10(5)",
pages = "429-446",
year = "1996"
}
@article{RTA*,
author = "R. E. Korf",
title = "Real-Time Heuristic Search",
journal = "Artificial Intelligence", Intelligence},
volume =
"42(3)", {10(5)},
pages =
"189-211", {429-446},
year =
"1990" {1996},
}
@inproceedings{KNIGHT,
author =
"K. Knight", {K. Knight},
title =
"Are {{Are many reactive agents better than a few deliberative
ones?", ones?}},
booktitle =
"International {International Joint Conference on Artificial Intelligence
(IJCAI-93)",
pages = "432-437",
year = "1993"
}
@inproceedings{ROADMAP-A*,
author = "L. Shmoulian and E. Rimon",
title = "Roadmap-{A}*: {A}n Algorithm for Minimizing Travel
Effort in Sensor Based Mobile Robot Navigation",
booktitle = "IEEE International Conference on Robotics and Automation", (IJCAI-93)},
pages =
"356-362", {432-437},
year =
"1998" {1993},
}
@article{A*e, @book{RONYTHESIS,
author =
"J. Pearl and J. H. Kim", {R. Stern},
title =
"Studies in semi-admissible heuristics",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
volume = "4",
pages = "392-400",
month = "July",
year = "1982"
}
@book{RONYTHESIS,
author="R. Stern",
title="Optimal {{Optimal Path Search in Unknown Physical
Enviroments", Enviroments}},
publisher =
"M.Sc. {M.Sc. Thesis, Department of Computer
Science, Science Bar-Ilan University, Israel; available on
http://www.cs.biu.ac.il/$\sim$felner",
year= "2001" http://www.cs.biu.ac.il/$\sim$felner},
year = {2001},
}
@ARTICLE{REPULSION-ATTRACTION,
author =
"Y. {Y. Kitamura and K. Teranishi and S.
Tatsumi", Tatsumi},
title =
"Organizational {{Organizational strategies for multi-agent real-time
search", search}},
journal =
"International {International Conference on Multi-Agent
Systems", Systems},
pages =
"409-416", {409-416},
year =
"1996", {1996},
}
@inproceedings{DSTAR94,
author =
"A. Stentz", {A. Stentz},
title =
"Optimal {{Optimal and Efficient Path Planning for Partially-Known
Environments", Environments}},
booktitle =
"IEEE {IEEE International Conference on Robotics and
Automation",
pages= "3310-3317", Automation},
pages = {3310-3317},
year =
"1994" {1994},
}
@inproceedings{DSTAR94S,
author =
"A. Stentz", {A. Stentz},
title =
"Optimal {{Optimal and Efficient Path Planning for Partially-Known
Environments", Environments}},
booktitle =
"ICRA",
pages= "3310-3317", {ICRA},
pages = {3310-3317},
year =
"1994", {1994},
}
@phdthesis{MARZ,
author="A. Marzetta",
title="ZRAM: author = {A. Marzetta},
title = {{ZRAM: a library of parallel search algorithms and its use in enumeration and combinatorial
optimization",
school="Swiss optimization}},
school = {Swiss Federal Institute of Technology, Zurich,
Switzerland",
year=1998} Switzerland},
year = {1998},
}
@phdthesis{GASSER,
author="R. Gasser",
title="Harnessing author = {R. Gasser},
title = {{Harnessing computational resources for efficient exhastive
search",
school="Swiss search}},
school = {Swiss Federal Institute of Technology, Zurich,
Switzerland",
year=1995} Switzerland},
year = {1995},
}
@article{Gh51,
author="B.~Ghosh",
title="Random author = {B.~Ghosh},
title = {{Random distances within a rectangle and between two
rectangles",
journal="Bulletin rectangles}},
journal = {Bulletin of the Culcutta Mathematical
Society",
volume="43",
pages="17-24",
year= 1951 Society},
volume = {43},
pages = {17-24},
year = {1951},
}
@article{PLANREUSE95,
author =
"B. {B. Nebel and J.
Koehler", Koehler},
title =
"Plan {{Plan reuse versus plan
generation", generation}},
journal =
"Artificial Intelligence", {Artificial Intelligence},
volume =
"76", {76},
pages =
"427-454", {427-454},
year =
"1995" {1995},
}
@inproceedings{PHA2002,
author="A. author = {A. Felner and R. Stern and S.
Kraus",
title="{PHA}*: Kraus},
title = {{{PHA}*: {P}erforming {A}* in Unknown Physical
Environments",
booktitle="International Environments}},
booktitle = {International Joint Conference on Autonomous Agents and Multi-Agent
Systems",
pages="240-247",
year= 2002 Systems},
pages = {240-247},
year = {2002},
}
@inproceedings{altplanaamas03,
author="A. author = {A. Felner and A. Pomeransky and J.
Rosenchein",
title="Searching Rosenchein},
title = {{Searching for an Alternative
Plan",
booktitle="International Plan}},
booktitle = {International Joint Conference on Autonomous Agents and Multi-Agent
Systems",
pages="33-40",
year= 2003 Systems},
pages = {33-40},
year = {2003},
}
@inproceedings{DSTARLITE02,
author="S. author = {S. Koenig and M.
Likhachev",
title="D* Lite",
booktitle="National Likhachev},
title = {{D* Lite}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-02)",
pages="476-483",
year= 2002
}
@incollection{LPA*,
author="S. Koenig and M. Likhachev",
title="Incremental {A}*",
booktitle="Advances in Neural Information Processing Systems 14
(NIPS)",
publisher="MIT Press, Cambridge, MA",
year= 2002 (AAAI-02)},
pages = {476-483},
year = {2002},
}
@article{ANTS2000,
author="A. author = {A. Wagner and A. M.
Bruckstein",
title="A{NTS}: Bruckstein},
title = {{A{NTS}: Agents, Networks, Trees, and
Subgraphs",
journal="Future Subgraphs}},
journal = {Future Generation Computer Systems
Journal",
volume= "16(8)",
pages= "915-926",
year= 2000 Journal},
volume = {16(8)},
pages = {915-926},
year = {2000},
}
@article{VANTS2001,
author="V. author = {V. Yanovski and I. A. Wagner and A. M.
Bruckstein",
title="Vertex-Ant-Walk: Bruckstein},
title = {{Vertex-Ant-Walk: {A} robust method for efficient exploration of faulty
graphs",
journal="Annals graphs}},
journal = {Annals of Mathematics and Artificial
Intelligence", Intelligence},
volume =
"31(1-4)",
pages= "99-112",
year= 2001 {31(1-4)},
pages = {99-112},
year = {2001},
}
@inproceedings{ZITA,
author="K. author = {K. Zita and M.
Veloso",
title="Route Veloso},
title = {{Route planning by
Analogy",
booktitle="International Analogy}},
booktitle = {International Conference on Case-Based
Reasoning",
year=1995} Reasoning},
year = {1995},
}
@inproceedings{LIU96,
author="B. Liu",
title="Intelligent author = {B. Liu},
title = {{Intelligent Route Finding: Combining Knowledge, Cases and An Efficient Search
Algorithm",
booktitle="ECAI-96",
pages="380-384",
year= 1996} Algorithm}},
booktitle = {ECAI-96},
pages = {380-384},
year = {1996},
}
@inproceedings{li99distributed,
author="W. author = {W. Li and M.
Zhang",
title="Distributed Zhang},
title = {{Distributed Task Plan: A Model for Designing Autonomous Mobile
Agents",
booktitle="International Agents}},
booktitle = {International Conference on Artificial
Intelligence",
pages="336-342",
year= 1999} Intelligence},
pages = {336-342},
year = {1999},
}
@article{jensen99obddbased,
author =
"R. {R. M. Jensen and M. M.
Veloso", Veloso},
title =
"{OBDD}-Based {{{OBDD}-Based Universal Planning: Specifying and Solving Planning Problems for Synchronized Agents in Non-deterministic
Domains", Domains}},
journal =
"Artificial {Artificial Intelligence Today, Recent Trends and
Developments",
publisher= "M.J. Developments},
publisher = {M.J. Wooldrige and M. Veloso (Eds.),
Springer-Verlag",
pages="212-248", Springer-Verlag},
pages = {212-248},
year =
"1999"} {1999},
}
@article{Bagchi88,
author =
"A. {A. Bagchi and A.
Sen", Sen},
title =
"Average-case {{Average-case analysis of heuristic search in tree-like
networks", networks}},
journal =
"Search {Search in Artificial
Intelligence",
publisher= "L. Intelligence},
publisher = {L. Kanal and V. Kumar, New York:
Springer-Verlag",
pages="131-165", Springer-Verlag},
pages = {131-165},
year =
"1988"} {1988},
}
@article{PUZ99,
author="R. author = {R. E.
Korf",
title="Sliding-tile Korf},
title = {{Sliding-tile puzzles and {R}ubik's {C}ube in {AI}
research",
journal="IEEE research}},
journal = {IEEE Intelligent
Systems",
volume="14",
pages= "8-12",
month="November",
year= 1999 Systems},
volume = {14},
pages = {8-12},
month = {November},
year = {1999},
}
@article{Kaelbling:96,
author="L. author = {L. P. Kaelbling and A. W.
Moore",
year="1996",
title="Reinforcement Learning: A Survey",
journal="Journal of Artificial Intelligence Research",
volume="4",
pages="237-285"}
@book{CLR01,
author="T. H. Cormen and C. E. Leiserson and R. L. Rivest and
C. Stein",
title= "Introduction to Algorithms",
publisher= "MIT Press",
address = "Cambridge, Massachusetts",
note Moore},
year =
"2nd edition",
year= "2001"}
# BIBTEX FILE
#
# To add a new entry follow the pattern
# The smallest syntax error screws up everything!
# When you add a new entry also add a line right here, how to refer to it
#
# When multiple authors, ,. . and , ....
# The style file automatically does the "et al" business and abbreviations
# If a letter MUST be capitalized in the title, enclose it in {}
# like: "Hierarchical {A}*"
#
# pancake: original paper defining the pancake puzzle
# felner: Korf and Felner's AIJ paper on disjoint PDB's
# korfmacro: Korf's 1985 Macro operators paper
# astar: original A* paper, 1968
# edelkamp98 branching factor
# edelkamp01 Planning with Pattern Databases
# istvan01: optimal macro-operators for Rubik's Cube
# pearl: Heuristics: Intelligent Search...
# prieditis: Machine Discovery of Effective
# korf2001: Korf & Reid & Edelkamp, AI journal
# korf98: Korf & Reid, analysis based on cumulative probability
# korf97: Rubik's Cube, AAAI
# pdb94: 15-Puzzle, Tech Report
# pdb96: Pattern DB, Can. Soc for AI
# pdb98: Pattern DB, Computational Intelligence
# valtorta84: A* and embeddings, Info. Sci.
# korf85: Iterative Deepening, AI 85
# STRIPS: Fikes & Nilsson's original paper, 1971
# holte96: Hierarchical A*, AAAI 96
# istvan99: technical report about the vector representation
# kaindl95: surveys ways of using memory to speed up IDA*
# evett95: PRA* - uses memory cleverly in parallel A*
# russell92: memory-bounded search
# dillenburg94: perimeter search
# robistvan: our AAAI-99 paper
# blocks: blocks world tech report
# ---
# AItheory: Banerji: AI {1996},
title = {{Reinforcement Learning: A
Theoretical Approach
# kibler: D. K.: Natural Generation of Admissible Heuristics
# holteJ96: Holte et al.: Speeding Up Problem-Solving by Abstraction
# pried95: Prieditis et al:abstractness Survey}},
journal = {Journal of
admissible heuristics
# guida79: Computing Heuristics
# gasching79: Devising Heuristics
# mostow89: Discovering Admissible Heuristics by Abs and Opt
# ---
# butler91: Fundamental algorithms for permutation groups
# dixon96: Permutation Groups
# ---
# refinement: Refinement Artificial Intelligence Research},
volume = {4},
pages = {237-285},
}
@book{CLR01,
author = {T. H. Cormen and C. E. Leiserson and R. L. Rivest and C. Stein},
title = {{Introduction to Algorithms}},
publisher = {MIT Press},
address = {Cambridge, Massachusetts},
note = {2nd edition},
year = {2001},
}
@BOOK{dixon96,
AUTHOR author =
"Dixon, {Dixon, J. D. and Mortimer,
B.",
TITLE B.},
title =
"Permutation Groups",
PUBLISHER {{Permutation Groups}},
publisher =
"Springer-Verlag",
YEAR {Springer-Verlag},
year =
1996,
SERIES {1996},
series =
"Graduate {Graduate Texts in
Mathematics" Mathematics},
}
@BOOK{butler91,
AUTHOR author =
"Butler, G.",
TITLE {Butler, G.},
title =
"Fundamental {{Fundamental Algorithms for Permutation
Groups",
PUBLISHER Groups}},
publisher =
"Springer-Verlag",
YEAR {Springer-Verlag},
year =
1991,
SERIES {1991},
series =
"Lecture {Lecture Notes in Computer
Science" Science},
}
@BOOK{AItheory,
AUTHOR author =
"Banerji, {Banerji, R.
B.",
TITLE B.},
title =
"Artificial {{Artificial Intelligence: A Theoretical
Approach",
PUBLISHER Approach}},
publisher =
"North Holland",
YEAR {North Holland},
year =
1980 {1980},
}
@TECHREPORT{kibler,
AUTHOR author =
"Kibler, D.",
TITLE {Kibler, D.},
title =
"Natural {{Natural Generation of Admissible
Heuristics",
INSTITUTION Heuristics}},
institution =
"University {University of California at
Irvine",
YEAR Irvine},
year =
1982,
MONTH {1982},
month =
"July",
NUMBER {July},
number =
"TR-188" {TR-188},
}
@ARTICLE{holteJ96,
AUTHOR author =
"Holte, {Holte, R. C. and Mkadmi, T. and Zimmer, R. M. and MacDonald, A.
J.",
TITLE J.},
title =
"Speeding {{Speeding Up Problem-Solving by Abstraction: A Graph-Oriented
Approach",
JOURNAL Approach}},
journal =
"Artificial Intelligence",
VOLUME {Artificial Intelligence},
volume =
85,
PAGES {85},
pages =
"321-361",
YEAR {321-361},
year =
1996 {1996},
}
@ARTICLE{pried95,
AUTHOR author =
"Prieditis, {Prieditis, A. and Davis,
R.",
TITLE R.},
title =
"Quantitatively {{Quantitatively relating abstractness to the accuracy of admissible
heuristics",
JOURNAL heuristics}},
journal =
"Artificial Intelligence",
VOLUME {Artificial Intelligence},
volume =
74,
PAGES {74},
pages =
"165-175",
YEAR {165-175},
year =
1995 {1995},
}
@ARTICLE{guida79,
AUTHOR author =
"Guida, {Guida, G. and Somalvico,
M.",
TITLE M.},
title =
"A {{A Method for computing Heuristics in problem
solving",
JOURNAL solving}},
journal =
"Information Sciences",
VOLUME {Information Sciences},
volume =
19,
PAGES {19},
pages =
"251-259",
YEAR {251-259},
year =
1979 {1979},
}
@inproceedings{gasching79,
AUTHOR author =
"Gasching, J.",
TITLE {Gasching, J.},
title =
"A {{A Problem Similarity Approach to Devising Heuristics: First
Results",
booktitle="International Results}},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI-79)",
PAGES (IJCAI-79)},
pages =
"301-307",
YEAR {301-307},
year =
1979 {1979},
}
@inproceedings{mostow89,
AUTHOR author =
"Mostow, {Mostow, J. and Prieditis,
A.",
TITLE A.},
title =
"Discovering {{Discovering Admissible Heuristics by Abstracting and Optimizing: A Transformational
Approach",
booktitle="International Approach}},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI-89)",
PAGES (IJCAI-89)},
pages =
"701-707",
YEAR {701-707},
year =
1989 {1989},
}
@ARTICLE{edelkamp01short,
AUTHOR author =
"Edelkamp, S.",
TITLE {Edelkamp, S.},
title =
"Planning {{Planning with Pattern
Databases",
JOURNAL Databases}},
journal =
"Proc, ECP-01",
PAGES {Proc, ECP-01},
pages =
"13-24",
YEAR {13-24},
year =
2001 {2001},
}
@ARTICLE{Schroedl05,
AUTHOR author =
"S. Schroedl",
TITLE {S. Schroedl},
title =
"An {{An Improved Search Algorithm for Optimal Multiple-Sequence
Alignment",
journal="Journal Alignment}},
journal = {Journal of Artificial Intelligence
Research",
VOLUME=23,
PAGES Research},
volume =
"587-623",
YEAR {23},
pages = {587-623},
year =
2005 {2005},
}
@inproceedings{MUL07,
author="S. author = {S. Edelkamp and P.
Kissmann",
title="Externalizing Kissmann},
title = {{Externalizing the Multiple Sequence Alignment Problem with Affine Gap
Costs",
booktitle="German Costs}},
booktitle = {German Conference on Artificial Intelligence (KI), LNCS
4467",
pages="444-447",
year=2007} 4467},
pages = {444-447},
year = {2007},
}
@inproceedings{edelkamp01,
AUTHOR author =
"Edelkamp, S.",
TITLE {Edelkamp, S.},
title =
"Planning {{Planning with Pattern
Databases", Databases}},
booktitle =
"European {European Conference on Planning
(ECP-01)",
PAGES (ECP-01)},
pages =
"13-24",
YEAR {13-24},
year =
2001 {2001},
}
@ARTICLE{edelkamp02,
AUTHOR author =
"Edelkamp, S.",
TITLE {Edelkamp, S.},
title =
"Symbolic {{Symbolic Pattern Databases in Heuristic Search
Planning",
JOURNAL Planning}},
journal =
"International {International Conference on AI Planning and Scheduling
(AIPS)",
PAGES (AIPS)},
pages =
"274-293",
YEAR {274-293},
year =
2002 {2002},
}
@inproceedings{edelkamp98,
AUTHOR author =
"Edelkamp, {Edelkamp, S. and Korf, R.
E.",
TITLE E.},
title =
"The {{The branching factor of regular
spaces",
booktitle="National spaces}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-98)",
YEAR (AAAI-98)},
year =
1998,
PAGES {1998},
pages =
"299-304"
} {299-304},
}
@inproceedings{korf98,
AUTHOR author =
"Korf, {Korf, R. E. and Reid,
M.",
TITLE M.},
title =
"Complexity {{Complexity Analysis of Admissible Heuristic
Search",
booktitle="National Search}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-98)",
YEAR (AAAI-98)},
year =
1998,
PAGES {1998},
pages =
"305-310" {305-310},
}
@ARTICLE{russell92,
AUTHOR author =
"Russell, S.",
TITLE {Russell, S.},
title =
"Efficient {{Efficient Memory-Bounded Search
Methods",
JOURNAL Methods}},
journal =
"European {European Conference on Artificial Intelligence
(ECAI-92)",
YEAR (ECAI-92)},
year =
1992,
PAGES {1992},
pages =
"1-5",
PUBLISHER {1-5},
publisher =
"Wiley" {Wiley},
}
@inproceedings{kaindl95,
AUTHOR author =
"Kaindl, {Kaindl, H. and Kainz, G. and Leeb, A. and Smetana,
H.",
TITLE H.},
title =
"How {{How to Use Limited Memory in Heuristic
Search",
booktitle="International Search}},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI-89)",
YEAR (IJCAI-89)},
year =
1995,
PAGES {1995},
pages =
"236-242" {236-242},
}
@inproceedings{korf97,
AUTHOR author =
"Korf, {Korf, R.
E.",
TITLE E.},
title =
"Finding {{Finding Optimal Solutions to {R}ubik's {C}ube Using Pattern
Databases",
booktitle="National Databases}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-97)",
YEAR (AAAI-97)},
year =
1997,
PAGES {1997},
pages =
"700-705" {700-705},
}
@inproceedings{korf97short,
AUTHOR author =
"Korf, {Korf, R.
E.",
TITLE E.},
title =
"Finding {{Finding Optimal Solutions to {R}ubik's {C}ube Using Pattern
Databases",
booktitle="National Databases}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-97)",
YEAR (AAAI-97)},
year =
1997,
PAGES {1997},
pages =
"700-705"} {700-705},
}
@inproceedings{KORF05,
author="Korf, author = {Korf, R.
E.",
title="Large E.},
title = {{Large scale parellel breadth-first
search",
booktitle="National search}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-05)",
PAGES (AAAI-05)},
pages = {1380-1385},
year =
"1380-1385",
year= 2005} {2005},
}
@inproceedings{KORF04,
author="Korf, author = {Korf, R.
E.",
title="Best-first E.},
title = {{Best-first frontier search with delayed duplicate
detection",
booktitle="National detection}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-04)",
PAGES (AAAI-04)},
pages = {650-657},
year =
"650-657",
year= 2004} {2004},
}
@TECHREPORT{pdb94,
AUTHOR author =
"Culberson, {Culberson, J. C. and Schaeffer,
J.",
TITLE J.},
title =
"Efficiently {{Efficiently Searching the
15-Puzzle",
INSTITUTION 15-Puzzle}},
institution =
"Department {Department of Computer Science, University of
Alberta",
YEAR Alberta},
year =
1994 {1994},
}
@TECHREPORT{blocks,
AUTHOR="Slaney, author = {Slaney, J. and Thi{\'e}baux,
S.",
TITLE S.},
title =
"Adventures {{Adventures in Blocks
World",
NOTE World}},
note =
"TR-ARP-7-94",
INSTITUTION {TR-ARP-7-94},
institution =
"Research {Research School of Information Sciences and Engineering and Centre for Information Science Research, Australian National
University",
YEAR University},
year =
1994 {1994},
}
@ARTICLE{pdb96,
AUTHOR author =
"Culberson, {Culberson, J. C. and Schaeffer,
J.",
TITLE J.},
title =
"Searching {{Searching with Pattern
Databases",
JOURNAL Databases}},
journal =
"Advances {Advances in Artificial Intelligence (Lecture Notes in Artificial Intelligence
1081)",
YEAR 1081)},
year =
1996,
PAGES {1996},
pages =
"402-416",
PUBLISHER {402-416},
publisher =
"Springer" {Springer},
}
@ARTICLE{pdb98,
AUTHOR author =
"Culberson, {Culberson, J. C. and Schaeffer,
J.",
TITLE J.},
title =
"Pattern Databases",
JOURNAL {{Pattern Databases}},
journal =
"Computational Intelligence",
YEAR {Computational Intelligence},
year =
1998, {1998},
volume =
"14", {14},
number =
"3",
PAGES {3},
pages =
"318-334" {318-334},
}
@ARTICLE{valtorta84,
AUTHOR author =
"Valtorta, M.",
TITLE {Valtorta, M.},
title =
"A {{A Result on the Computational Complexity of Heuristic Estimates for the {A}*
Algorithm",
JOURNAL Algorithm}},
journal =
"Information Sciences",
YEAR {Information Sciences},
year =
1984,
PAGES {1984},
pages =
"47-59" {47-59},
}
@ARTICLE{evett95,
AUTHOR author =
"Evett, {Evett, M.P. and Hendler, J.A. and Mahanti, A. and Nau,
D.",
TITLE D.},
title =
"{PRA}*: {{{PRA}*: Massively Parallel Heuristic
Search",
JOURNAL Search}},
journal =
"Journal {Journal of Parallel and Distributed
Computing",
VOLUME Computing},
volume =
25,
NUMBER {25},
number =
2,
PAGES {2},
pages =
"133-143",
YEAR {133-143},
year =
1995 {1995},
}
@ARTICLE{dillenburg94,
AUTHOR author =
"Dillenburg, {Dillenburg, J. F. and Nelson, P.
C.",
TITLE C.},
title =
"Perimeter Search",
JOURNAL {{Perimeter Search}},
journal =
"Artificial Intelligence",
VOLUME {Artificial Intelligence},
volume =
65,
YEAR {65},
year =
1994,
PAGES {1994},
pages =
"165-178" {165-178},
}
@ARTICLE{korfmacro,
AUTHOR author =
"Korf, {Korf, R.
E.",
TITLE E.},
title =
"Macro-operators: {{Macro-operators: A weak method for
learning",
JOURNAL learning}},
journal =
"Artificial Intelligence",
VOLUME {Artificial Intelligence},
volume =
26,
YEAR {26},
year =
1985,
PAGES {1985},
pages =
"35-77" {35-77},
}
@ARTICLE{STRIPS,
AUTHOR author =
"Fikes, {Fikes, R. and Nilsson, N.
J.",
TITLE J.},
title =
"{STRIPS}: {{{STRIPS}: A New Approach to the Application of Theorem Proving to Problem
Solving",
JOURNAL Solving}},
journal =
"Artificial Intelligence",
VOLUME {Artificial Intelligence},
volume =
2,
YEAR {2},
year =
1971,
PAGES {1971},
pages =
"189-208" {189-208},
}
@ARTICLE{astar,
AUTHOR author =
"Hart, {Hart, P.E. and Nilsson, N. J. and Raphael,
B.",
TITLE B.},
title =
"A {{A Formal Basis for the Heuristic Determination of Minimum Cost
Paths",
JOURNAL Paths}},
journal =
"IEEE {IEEE Transactions on Systems Science and
Cybernetics",
VOLUME Cybernetics},
volume =
4,
ISSUE {4},
issue =
2,
YEAR {2},
year =
1968,
PAGES {1968},
pages =
"100-107" {100-107},
}
@TECHREPORT{istvan99,
AUTHOR author =
"Hern{\'a}dv{\"o}lgyi, {Hern{\'a}dv{\"o}lgyi, I. T. and Holte, R.
C.",
TITLE C.},
title =
"{PSVN}: {{{PSVN}: A Vector Representation for Production
Systems",
INSTITUTION Systems}},
institution =
"School {School of Information Technology and Engineering, University of
Ottawa",
NUMBER Ottawa},
number =
"TR-99-04",
YEAR {TR-99-04},
year =
1999 {1999},
}
@ARTICLE{istvan01,
AUTHOR author =
"Hern{\'a}dv{\"o}lgyi, {Hern{\'a}dv{\"o}lgyi, I.
T.",
TITLE T.},
title =
"Searching {{Searching for Macro Operators with Automatically Generated
Heuristics",
JOURNAL Heuristics}},
journal =
"Advances {Advances in Artificial Intelligence - Proceedings of the Fourteenth Biennial Conference of the Canadian Society for Computational Studies of Intelligence (LNAI
2056)",
YEAR 2056)},
year =
2001,
PAGES {2001},
pages =
"194-203" {194-203},
}
@inproceedings{holte96,
AUTHOR author =
"Holte, {Holte, R. C. and Perez, M. B. and Zimmer, R. M. and MacDonald, A.
J.",
TITLE J.},
title =
"Hierarchical {{Hierarchical {A}*: Searching Abstraction Hierarchies
Efficiently",
booktitle="National Efficiently}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-96)",
YEAR (AAAI-96)},
year =
1996,
PAGES {1996},
pages =
"530-535" {530-535},
}
@inproceedings{holte96short,
AUTHOR author =
"Holte, {Holte, R. C. and Perez, M. B. and Zimmer, R. M. and MacDonald, A.
J.",
TITLE J.},
title =
"Hierarchical {{Hierarchical {A}*: Searching Abstraction Hierarchies
Efficiently",
booktitle="National Efficiently}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-96)",
PAGES (AAAI-96)},
pages =
"530-535",
YEAR {530-535},
year =
1996, {1996},
}
@ARTICLE{prieditis,
AUTHOR author =
"Prieditis, {Prieditis, A.
E.",
TITLE E.},
title =
"Machine {{Machine Discovery of Effective Admissible
Heuristics",
JOURNAL Heuristics}},
journal =
"Machine Learning",
VOLUME {Machine Learning},
volume =
12,
YEAR {12},
year =
1993,
PAGES {1993},
pages =
"117-141" {117-141},
}
@inproceedings{robistvan,
AUTHOR author =
"Holte, {Holte, R. C. and Hern{\'a}dv{\"o}lgyi, I.
T.",
TITLE T.},
title =
"A {{A Space-Time Tradeoff for Memory-Based
Heuristics",
booktitle="National Heuristics}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-99)",
YEAR (AAAI-99)},
year =
1999,
PAGES {1999},
pages =
"704-709" {704-709},
}
@article{BagchiM83,
author = {A. Bagchi and A. Mahanti},
title =
{Search {{Search Algorithms Under Different Kinds of Heuristics - {A} Comparative
Study}, Study}},
journal = {Journal of the ACM},
volume = {30},
number = {1},
year = {1983},
pages = {1-21},
ee = {http://doi.acm.org/10.1145/322358.322359},
bibsource = {DBLP,
http://dblp.uni-trier.de} http://dblp.uni-trier.de},
}
@BOOK{pearl,
AUTHOR author =
"Pearl, J.",
TITLE {Pearl, J.},
title =
"Heuristics: {{Heuristics: Intelligent Search Strategies for Computer Problem
Solving",
PUBLISHER Solving}},
publisher =
"Addison-Wesley",
YEAR {Addison-Wesley},
year =
1984 {1984},
}
@ARTICLE{pancake,
AUTHOR author =
"Dweighter, H.",
TITLE {Dweighter, H.},
title =
"Problem E2569",
JOURNAL {{Problem E2569}},
journal =
"American {American Mathematical
Monthly",
VOLUME Monthly},
volume =
82,
YEAR {82},
year =
1975,
PAGES {1975},
pages =
"1010" {1010},
}
@ARTICLE{Brunetta,
AUTHOR author =
" L. {L. Brunetta and M. Conforti and N.
Rinaldi",
TITLE Rinaldi},
title =
"A {{A branch-and-cut Algorithm for the Equicut
Problem",
JOURNAL Problem}},
journal =
"Math. Program.",
VOLUME {Math. Program.},
volume =
78,
PAGES {78},
pages =
"243-263",
YEAR {243-263},
year =
1997 {1997},
}
@ARTICLE{Ferreira,
AUTHOR author =
"A. {A. Ferreira and A. Martin and C. C. de Souza and R. Weismantel and L. A.
Wolsey",
TITLE Wolsey},
title =
"The {{The Node Capacitated Graph Partitioning Problem: A Computational
Study",
JOURNAL Study}},
journal =
"Math Program.",
VOLUME {Math Program.},
volume =
81,
PAGES {81},
pages =
"229-256",
YEAR {229-256},
year =
1998 {1998},
}
@ARTICLE{Johnson,
AUTHOR author =
"E. {E. L. Johnson and A. Mehrotra and G. L.
Nemhauser",
TITLE Nemhauser},
title =
"Min-cut Clustering",
JOURNAL {{Min-cut Clustering}},
journal =
"Math Program.",
VOLUME {Math Program.},
volume =
62,
PAGES {62},
pages =
"133-151",
YEAR {133-151},
year =
1993 {1993},
}
@ARTICLE{Clausen,
AUTHOR author =
"J. {J. Clausen and J.
Larsson-Traff",
TITLE Larsson-Traff},
title =
"Implementation {{Implementation of Parallel Branch and Bound Algorithms - Experiences with the Graph partitioning
Problem",
JOURNAL Problem}},
journal =
"Ann. {Ann. Oper.
Res.",
VOLUME Res.},
volume =
33,
PAGES {33},
pages =
"331-349",
YEAR {331-349},
year =
1991 {1991},
}
@ARTICLE{Karisch,
AUTHOR author =
"S. {S. E. Karisch and F. Rendl and J.
Clausen ",
TITLE Clausen},
title =
"Solving {{Solving Graph Bisection Problems with Semidefinite
Programming",
JOURNAL Programming}},
journal =
"Informs: {Informs: Journal of
Computing",
VOLUME Computing},
volume =
"12(3)",
PAGES {12(3)},
pages =
"177-191",
YEAR {177-191},
year =
2000 {2000},
}
@ARTICLE{Sensen,
AUTHOR author =
"N {N .
Sensen",
TITLE Sensen},
title =
"Lower {{Lower Bounds and Exact Algorithms for the Graph Partitioning Problem with Multicommodity
FLows",
JOURNAL FLows}},
journal =
"Algorithms {Algorithms - ESA
2001",
PAGES 2001},
pages =
"391-403",
YEAR {391-403},
year =
2001 {2001},
}
@ARTICLE{APPLEBY,
AUTHOR author =
"S. {S. Appleby and S.
Steward",
TITLE Steward},
title =
"Mobile {{Mobile software agents for control in telecommunication
networks",
JOURNAL networks}},
journal =
"British {British Telecom Technology Journal
12",
PAGES 12},
pages =
"104-113",
YEAR {104-113},
year =
1994 {1994},
}
@ARTICLE{mero84,
AUTHOR author =
"L. Mero",
TITLE {L. Mero},
title =
"A {{A Heuristic Search Algorithm with Modifiable
Estimate",
JOURNAL Estimate}},
journal = {Artificial Intelligence},
volume =
"Artificial Intelligence",
VOLUME="23",
YEAR {23},
year =
1984,
PAGES {1984},
pages =
"13-27" {13-27},
}
@article {chen96, @article{chen96,
author =
"T. {T. Chen and S.
Skiena", Skiena},
title =
"Sorting {{Sorting with Fixed-Length
Reversals", Reversals}},
journal =
"Discrete {Discrete Applied
Mathematics", Mathematics},
volume =
"71", {71},
number =
"1-3", {1-3},
year =
"1996", {1996},
pages =
"269-295"} {269-295},
}
@ARTICLE{SCHOOND,
AUTHOR author =
"R. {R. Schoonderwoerd and O. Holland and J. Bruten and L.
Rothkrantz",
TITLE Rothkrantz},
title =
"Ant-based {{Ant-based load balancing in telecommunications
networks",
JOURNAL networks}},
journal =
"Adaptive {Adaptive Behavior,
5(2)",
YEAR 5(2)},
year =
1996 {1996},
}
@inproceedings{Ishida00,
author =
"M. {M. Shimbo and T.
Isida", Isida},
title =
"Towards {{Towards Real-Time Search with Inadmissible
Heuristics", Heuristics}},
booktitle =
" European {European Conference on Artificial Intelligence
(ECAI)", (ECAI)},
pages =
"609-613", {609-613},
year =
"2000" {2000},
}
@inproceedings{Ishida00short,
author =
"M. {M. Shimbo and T.
Isida", Isida},
title =
"Towards {{Towards Real-Time Search with Inadmissible
Heuristics", Heuristics}},
booktitle =
"ECAI", {ECAI},
pages =
"609-613", {609-613},
year =
"2000" {2000},
}
@inproceedings{Koenig05,
author =
"M. {M. Likhachev and S.
Koenig", Koenig},
title =
"A {{A Generalized Framework for Lifelong Planning
{A}*",
booktitle= "International {A}*}},
booktitle = {International Conference on Automated Planning and Scheduling
(ICAPS-05)", (ICAPS-05)},
pages =
"99-108", {99-108},
year =
"2005" {2005},
}
@inproceedings{Koenig05short,
author =
"M. {M. Likhachev and S.
Koenig", Koenig},
title =
"A {{A Generalized Framework for Lifelong Planning
{A}*",
booktitle= "International {A}*}},
booktitle = {International Conference on Automated Planning and Scheduling
(ICAPS-05)", (ICAPS-05)},
pages =
"99-108", {99-108},
year =
"2005" {2005},
}
@inproceedings{incijcai09,
author="A. author = {A. Junghanns and J.
Schaeffer",
title="Domain-dependent Schaeffer},
title = {{Domain-dependent single-agent search
enhancements",
booktitle="International enhancements}},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI-99)",
pages="570-575",
year= 1999} (IJCAI-99)},
pages = {570-575},
year = {1999},
}
@article{predjair,
author = {U. Zahavi and A. Felner and N. Burch and R. C. Holte},
title =
{Predicting {{Predicting the Performance of {IDA}* (with {BPMX}) with Conditional
Distributions}, Distributions}},
journal =
"Journal {Journal of Artificial Intelligence
Research", Research},
volume =
"37", {37},
pages =
"41-83", {41-83},
year =
"2010"} {2010},
}
@inproceedings{DUAL2005,
author = {A. Felner and U. Zahavi and J. Schaeffer and R. C. Holte},
title =
{Dual {{Dual Lookups in Pattern
Databases},
booktitle="International Databases}},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI-05)", (IJCAI-05)},
year = {2005},
pages = {103-108},
ee = {http://www.ijcai.org/papers/0359.pdf},
bibsource = {DBLP,
http://dblp.uni-trier.de} http://dblp.uni-trier.de},
}
@inproceedings{DUALAAAI06,
author = {U. Zahavi and A. Felner and R. C. Holte and J. Schaeffer},
title =
{Dual {{Dual Search in Permutation State
Spaces},
booktitle="National Spaces}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-06)", (AAAI-06)},
year = {2006},
pages = {1076-1081},
bibsource = {DBLP,
http://dblp.uni-trier.de} http://dblp.uni-trier.de},
}
@inproceedings{INCON2007,
author = {U. Zahavi and A. Felner and J. Schaeffer and N. R. Sturtevant},
title =
{Inconsistent Heuristics},
booktitle="National {{Inconsistent Heuristics}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-07)", (AAAI-07)},
year = {2007},
pages = {1211-1216},
bibsource = {DBLP,
http://dblp.uni-trier.de} http://dblp.uni-trier.de},
}
@inproceedings{PREDAAAI08,
author = {U. Zahavi and A. Felner and N. Burch and R. C. Holte},
title =
{Predicting {{Predicting the Performance of {IDA}* with Conditional
Distributions},
booktitle="National Distributions}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-08)", (AAAI-08)},
year = {2008},
pages = {381-386},
bibsource = {DBLP,
http://dblp.uni-trier.de} http://dblp.uni-trier.de},
}
@inproceedings{ZHOU04,
author="R. author = {R. Zhou and E.
Hansen",
title="Space-Efficient Hansen},
title = {{Space-Efficient Memory-Based
Heuristics",
booktitle="National Heuristics}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-04)",
pages="677-682",
year= 2004} (AAAI-04)},
pages = {677-682},
year = {2004},
}
@inproceedings{ZHOU04b,
author="R. author = {R. Zhou and E.
Hansen",
title="Structured Hansen},
title = {{Structured Duplicate Detection in External-Memory Graph
Search",
booktitle="National Search}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-04)",
pages="683-689",
year= 2004} (AAAI-04)},
pages = {683-689},
year = {2004},
}
@inproceedings{ZHOU04c,
author="R. author = {R. Zhou and E.
Hansen",
title="Breadth-First Hansen},
title = {{Breadth-First Heuristic
Search",
booktitle= "International Search}},
booktitle = {International Conference on Automated Planning and Scheduling
(ICAPS-04)",
pages="92-100",
year= 2004} (ICAPS-04)},
pages = {92-100},
year = {2004},
}
@inproceedings{SYM02,
author="S. Edelkamp",
title="Symbolic author = {S. Edelkamp},
title = {{Symbolic Pattern Databases in Heuristic Search
Planning",
booktitle="Proc. Planning}},
booktitle = {Proc. International Conference on AI Planning and Scheduling
(AIPS)",
pages="274-293",
year= 2002}
@article {BRYNT92, (AIPS)},
pages = {274-293},
year = {2002},
}
@article{BRYNT92,
author =
"O. Dunkel", {O. Dunkel},
title =
"Symbolic {{Symbolic Boolean Manipulation with Ordered Binary Decision
Diagrams", Diagrams}},
journal =
"ACM {ACM Computing
Surveys", Surveys},
volume =
"24(3)", {24(3)},
year =
"1992", {1992},
pages =
"142-170"} {142-170},
}
@inproceedings{STERNDILL,
author="U. author = {U. Stern and D. L.
Dill.",
title="Improved Dill.},
title = {{Improved Probabilistic Verification by Hash
Compaction",
booktitle="Advanced Compaction}},
booktitle = {Advanced Research Working Conference on Correct Hardware Design and Verification
Methods",
pages="206-240",
year= 1995} Methods},
pages = {206-240},
year = {1995},
}
@article{BLOOM,
author =
"B. {B. H.
Bloom", Bloom},
title =
"Space/Time {{Space/Time Trade-offs in Hash Coding with Allowable
Errors", Errors}},
journal =
"Communications {Communications of the
ACM", ACM},
volume =
"13(3)", {13(3)},
year =
"1970", {1970},
pages =
"422-426"} {422-426},
}
@inproceedings{OCTREE02,
author="M. author = {M. McNaughton and P. Lu and J. Schaeffer and D.
Szafron",
title="Memory Szafron},
title = {{Memory Efficient {A}* Heuristics for Multiple Sequence
Alignment",
booktitle="National Alignment}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-02)",
pages="737-743",
year= 2002} (AAAI-02)},
pages = {737-743},
year = {2002},
}
@inproceedings{compress04short,
author="A. author = {A. Felner and R. Meshulam and R. C. Holte and R. E.
Korf",
title="Compressing Korf},
title = {{Compressing Pattern
Databases",
booktitle="National Databases}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-04)",
pages="638-643",
year= 2004} (AAAI-04)},
pages = {638-643},
year = {2004},
}
@article{compressjur,
author = {A. Felner and R. E. Korf and R. Meshulam and R. C. Holte},
title =
{Compressed {{Compressed Pattern
Databases},
journal="Journal Databases}},
journal = {Journal of Artificial Intelligence
Research", Research},
volume = {30},
year = {2007},
pages =
{213-247} {213-247},
}
@inproceedings{compress04,
author="A. author = {A. Felner and R. Meshulam and R. C. Holte and R. E.
Korf",
title="Compressing Korf},
title = {{Compressing Pattern
Databases",
booktitle="National Databases}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-04)",
pages="638-643",
year= 2004}
@article {dunkel, (AAAI-04)},
pages = {638-643},
year = {2004},
}
@article{dunkel,
author =
"O. Dunkel", {O. Dunkel},
title =
"Editorial {{Editorial note concerning advanced problem
3918", 3918}},
journal =
"American {American Mathematical
Monthly", Monthly},
volume =
"48", {48},
year =
"1941", {1941},
pages =
"219"}
@article {frame, {219},
}
@article{frame,
author =
"J. {J. S.
Frame", Frame},
title =
"Solution {{Solution to advanced problem
3918", 3918}},
journal =
"American {American Mathematical
Monthly", Monthly},
volume =
"48", {48},
year =
"1941", {1941},
pages =
"216-217"}
@article {SARA2000, {216-217},
}
@article{SARA2000,
author =
"I. {I. Hern{\'a}dv{\"o}lgyi and R. C.
Holte ", Holte},
title =
"Experiments {{Experiments with automatically created memory-based
heuristics", heuristics}},
journal =
"Proc. {Proc. SARA-2000, Lecture Notes in Artificial
Intelligence", Intelligence},
volume =
1864, {1864},
pages =
"281-290", {281-290},
year =
2000}
@article {korfthesis, {2000},
}
@article{korfthesis,
author =
"R. {R. E.
Korf", Korf},
title =
"Macro-operators: {{Macro-operators: A weak method for
learning", learning}},
journal =
"Artificial Intelligence", {Artificial Intelligence},
volume =
"26", {26},
number =
"1", {1},
year =
"1985", {1985},
pages =
"35-77"}
@article {Adler, {35-77},
}
@article{Adler,
author =
"F. {F. R. Adler and D. M.
Gordon", Gordon},
title =
"Information {{Information Collection and Spread by Networks of Patrolling
Ants", Ants}},
journal =
"The {The American
Naturalist", Naturalist},
volume =
"140", {140},
number =
"3", {3},
year =
"1992", {1992},
pages =
"373-400"}
@article {Gordon, {373-400},
}
@article{Gordon,
author =
"D. {D. M.
Gordon", Gordon},
title =
"The {{The Expandable Network of Ant
Exploration", Exploration}},
journal =
"Animal Behaviour", {Animal Behaviour},
volume =
"50", {50},
year =
"1995", {1995},
pages =
"372-378"}
@article {EAW, {372-378},
}
@article{EAW,
author =
"V. {V. M. Yanovski and I. A. Wagner and A. M.
Bruckstein", Bruckstein},
title =
"A {{A distributed ant algorithm for efficiently patrolling a
network", network}},
journal =
"Algorithmica ", {Algorithmica},
volume =
"37", {37},
year =
"2003", {2003},
pages =
"165-186"}
@article {Dorigo, {165-186},
}
@article{Dorigo,
author =
"M. {M. Dorigo, V. Maniezzo and A.
Colorni", Colorni},
title =
"The {{The Ant System: Optimization by a Colony of Cooperating
Agents", Agents}},
journal =
"IEEE {IEEE Transactions on Systems, Man, and Cybernetics-Part
B", B},
year =
"1994", {1994},
volume =
"26", {26},
number =
"1", {1},
pages =
"29-41"}
@article {DB2003, {29-41},
}
@article{DB2003,
author =
"V. {V. Marik, D. C. McFarlane, P.
Valckenaers", Valckenaers},
title =
"Holonic {{Holonic and Multi-Agent Systems for
Manufacturing", Manufacturing}},
journal =
"First {First International Conference on Industrial Applications of Holonic and Multi-Agent
Systems", Systems},
year =
"2003"} {2003},
}
@article{ANTNET98,
author="G. author = {G. Di Caro and and M.
Dorigo",
title="Ant{N}et: Dorigo},
title = {{Ant{N}et: Distributed Stigmergetic Control for Communications
Networks",
journal="Journal Networks}},
journal = {Journal of Artificial Intelligence
Research",
volume= 9,
pages="317-365",
year=1998 Research},
volume = {9},
pages = {317-365},
year = {1998},
}
@inproceedings{NEWANTS04,
author="A. author = {A. Felner and Yaron Shoshani and Israel A. Wagner and Alfred M.
Bruckstein ",
title="Large Bruckstein},
title = {{Large Pheromones: A Case Study with Multi-agent Physical
{A}*",
booktitle="Forth {A}*}},
booktitle = {Forth International Workshop on Ant Colony Optimization and Swarm Intelligence. (ANTS
2004)",
pages="366-373",
year=2004 2004)},
pages = {366-373},
year = {2004},
}
@article{pattern,
author =
"J. {J. Culberson and J.
Schaeffer", Schaeffer},
title =
"Pattern databases", {{Pattern databases}},
journal =
"Computational Intelligence", {Computational Intelligence},
volume =
"14", {14},
number =
"3", {3},
pages =
"318-334", {318-334},
year =
"1998"}
@article {disjoint, {1998},
}
@article{disjoint,
author =
"R. {R. E. Korf and A.
Felner", Felner},
title =
"Disjoint {{Disjoint pattern database
heuristics", heuristics}},
journal =
"Artificial Intelligence", {Artificial Intelligence},
volume =
"134", {134},
number =
"1-2", {1-2},
year =
"2002", {2002},
month =
"Jan", {Jan},
pages =
"9-22"} {9-22},
}
@inproceedings{rubik,
author="Korf, author = {Korf, R.
E.",
title="Finding E.},
title = {{Finding optimal solutions to {R}ubik's Cube using pattern
databases",
booktitle="National databases}},
booktitle = {National Conference on Artificial Intelligence
(AAAI-97)",
pages="700-705",
year= 1997} (AAAI-97)},
pages = {700-705},
year = {1997},
}
@inproceedings{twentyfour,
author="Korf, author = {Korf, R. E. and L.A.
Taylor",
title="Finding Taylor},
title = {{Finding Optimal Solutions to the Twenty-Four
Puzzle",
booktitle="National Conference on Artificial Intelligence (AAAI-96)",
pages="1202-1207",
year= 1996}
@inproceedings {bode+hinz,
author = "J.-P. Bode and A.M. Hinz",
title = "Results and open problems on the {T}ower of {H}anoi", Puzzle}},
booktitle =
"Southeastern International {National Conference on
Combinatorics, Graph Theory, and Computing",
address Artificial Intelligence (AAAI-96)},
pages =
"Boca Raton, FL", {1202-1207},
year =
"1999"}
@inproceedings {aaai00, {1996},
}
@inproceedings{aaai00,
author =
"R. {R. E. Korf and W.
Zhang", Zhang},
title =
"Divide-and-conquer {{Divide-and-conquer frontier search applied to optimal sequence
alignment", alignment}},
booktitle =
"National {National Conference on Artificial Intelligence
(AAAI-2000)", (AAAI-2000)},
pages =
"910-916", {910-916},
year =
"2000"}
@inproceedings {ddd, {2000},
}
@inproceedings{ddd,
author =
"Korf, {Korf, R.
E.", E.},
title =
"Best-first {{Best-first frontier search with delayed duplicate
detection", detection}},
booktitle =
"National {National Conference on Artificial Intelligence
(AAAI-04)", (AAAI-04)},
pages =
"650-657", {650-657},
year =
"2004"} {2004},
}
@inproceedings{karp72,
author =
"Karp, R.M.", {Karp, R.M.},
title =
"Reducibility {{Reducibility among combinatorial
problems", problems}},
booktitle =
"R. {R. E. Miller and J.W. Thatcher (eds.), Complexity of Computer
Computations", Computations},
address =
"Plenum {Plenum Press, New
York", York},
pages =
"85-103", {85-103},
year =
"1972"}
@inproceedings {hinz, {1972},
}
@inproceedings{hinz,
author =
"Andreas {Andreas M.
Hinz", Hinz},
title =
"The {{The Tower of
{H}anoi", {H}anoi}},
booktitle =
"Algebras {Algebras and Combinatorics: Proceedings of
ICAC'97", ICAC'97},
address =
"Hong Kong", {Hong Kong},
publisher =
"Springer-Verlag", {Springer-Verlag},
year =
"1997", {1997},
pages =
"277-289"} {277-289},
}
@TECHREPORT{RIP,
AUTHOR author = {G. Malkin},
TITLE title =
{RIPng {{RIPng Protocol Applicability
Statement},
INSTITUTION Statement}},
institution = {IETF Network Working Group},
YEAR year = {1997},
type = {RFC},
number = {2081},
month = {January},
}
@TECHREPORT{BGP,
AUTHOR author = {Y. Rekhter and T. Li},
TITLE title =
{A {{A Border Gateway
Protocol},
INSTITUTION Protocol}},
institution = {T.J Watson Research Center IBM Corporation \& Cisco Systems},
YEAR year = {1995},
type = {RFC},
number = {1771},
month = {March},
}
@TECHREPORT{ACO3,
AUTHOR author = {Gambardella L. M. and M. Dorigo},
TITLE title =
{HAS-SOP: {{HAS-SOP: An Hybrid Ant System for the Sequential Ordering
Problem},
INSTITUTION Problem}},
institution = {IDSIA},
YEAR year = {1997},
type = {Technical Report},
number = {IDSIA 97-11},
address = {Lugano, Switzerland},
}
@TECHREPORT{survey17,
AUTHOR author = {M.Benda and V.Jagannathan and R.Dodhiawalla},
TITLE title =
{On {{On Optimal Cooperation of Knowledge
Sources},
INSTITUTION Sources}},
institution = {Boeing AI Center},
YEAR year = {1985},
type = {Technical Report},
number = {BCS-G 2010-28},
month = {August},
}
@ARTICLE{ACO1,
AUTHOR author = {Dorigo M. and L.M. Gambardella},
TITLE title =
{Ant {{Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman
Problem},
JOURNAL Problem}},
journal = {IEEE Transactions on Evolutionary Computation},
YEAR year = {1997},
volume = {1},
number = {1},
pages = {53-66},
}
@ARTICLE{ACO2,
AUTHOR author = {Dorigo M. and G. Di Caro and L. M. Gambardella},
TITLE title =
{Ant {{Ant Algorithms for Discrete
Optimization},
JOURNAL Optimization}},
journal = {Artificial Life},
YEAR year = {1999},
volume = {5},
number = {2},
pages = {137-172},
}
@ARTICLE{ACO4,
AUTHOR author = {Gambardella L. M. and E. Taillard and M. Dorigo},
TITLE title =
{Ant {{Ant Colonies for the Quadratic Assignment
Problem},
JOURNAL Problem}},
journal = {Journal of the Operational Research Society},
YEAR year = {1999},
volume = {50},
pages = {167-176},
}
@INPROCEEDINGS{ACO5,
AUTHOR author = {Bullnheimer B. and R.F. Hartl and C. Strauss},
TITLE title =
{An {{An Improved Ant system Algorithm for the Vehicle Routing
Problem},
BOOKTITLE Problem}},
booktitle = {Sixth Viennese workshop on Optimal Control, Dynamic
Games, Games Nonlinear Dynamics and Adaptive Systems},
YEAR year = {1997},
pages = {21-23},
address = {Vienna},
month = {May},
}
@ARTICLE{ACO6,
AUTHOR author = {Colorni A. and M. Dorigo and V. Maniezzo and M. Trubian},
TITLE title =
{Ant {{Ant system for Job-shop
Scheduling},
JOURNAL Scheduling}},
journal = {JORBEL -- Belgian Journal of Operations Research, Statistics and Computer Science},
YEAR year = {1994},
volume = {34},
number = {1},
pages = {39-53},
}
@ARTICLE{ACO7,
AUTHOR author = {Costa D. and A. Hertz},
TITLE title =
{Ants {{Ants Can Colour
Graphs},
JOURNAL Graphs}},
journal = {Journal of the Operational Research Society},
YEAR year = {1997},
volume = {48},
pages = {295-305},
}
@ARTICLE{ACO9,
AUTHOR author = {Schoonderwoerd R. and O. Holland and J. Bruten and L. Rothkrantz},
TITLE title =
{Ant-based {{Ant-based Load Balancing in Telecommunications
Networks},
JOURNAL Networks}},
journal = {Adaptive Behavior},
YEAR year = {1997},
volume = {5},
number = {2},
pages = {169-207},
}
@ARTICLE{ACO10,
AUTHOR author = {Di Caro G. and Dorigo M},
TITLE title =
{AntNet: {{AntNet: Distributed Stigmergetic Control for Communications
Networks},
journal="Journal Networks}},
journal = {Journal of Artificial Intelligence
Research",
YEAR Research},
year = {1998},
volume = {9},
pages = {317-365},
}
@INPROCEEDINGS{ACO11,
AUTHOR author = {Navarro Varela G. and M.C. Sinclair},
TITLE title =
{Ant {{Ant Colony Optimisation for Virtual-Wavelength-Path Routing and Wavelength
Allocation},
BOOKTITLE Allocation}},
booktitle = {Congress on Evolutionary Computation (CEC'99)},
YEAR year = {1999},
pages = {1809-1816},
address = {Washington DC, USA},
month = {July},
}
@BOOK{newAnts1,
AUTHOR author = {B. Houmlldobler and E.O. Wilson},
TITLE title =
{The ants},
PUBLISHER {{The ants}},
publisher = {Springer},
YEAR year = {1990},
address = {Berlin},
}
@ARTICLE{newAnts2,
AUTHOR author = {S. Goss and S. Aron and J.L. Deneubourg and J.M. Pasteels},
TITLE title =
{Self-organized {{Self-organized shortcuts in the argentine
ant},
JOURNAL ant}},
journal = {Naturwissenschaften},
YEAR year = {1989},
volume = {76},
pages = {579-581},
}
@ARTICLE{newAnts3,
AUTHOR author = {R. Beckers and J.L. Deneubourg and S. Goss},
TITLE title =
{Trails {{Trails and U-turns in the selection of the shortest path by the ant Lasius
Niger},
JOURNAL Niger}},
journal = {Journal of Theoretical Biology},
YEAR year = {1992},
volume = {159},
pages = {397-415},
}
@ARTICLE{MultiAgentBiology1,
AUTHOR author = {R.C.Arkin and T.Balch},
TITLE title =
{AuRA: {{AuRA: Principles and Practice in
Review},
JOURNAL Review}},
journal = {Journal of Experimental and Theoretical Artificial Intelligence},
YEAR year = {1997},
volume = {9},
number = {2/3},
pages = {175-188},
}
@ARTICLE{survey3,
AUTHOR author = {R.C.Arkin},
TITLE title =
{Integrating {{Integrating Behavioral, Perceptual, and World Knowledge in Reactive
Navigation},
JOURNAL Navigation}},
journal = {Robotics and Autonomous Systems},
YEAR year = {1990},
volume = {6},
pages = {105-122},
}
@ARTICLE{survey16,
AUTHOR author = {T.R.Balch and R.C.Arkin},
TITLE title =
{Communication {{Communication in Reactive Multiagent Robotic
Systems},
JOURNAL Systems}},
journal = {Autonomous Robots},
YEAR year = {1994},
volume = {1},
number = {1},
pages = {1-25},
}
@ARTICLE{survey20,
AUTHOR author = {R.A.Brooks},
TITLE title =
{A {{A Robust Layered Control System for a Mobile
Robot},
JOURNAL Robot}},
journal = {IEEE Journal of Robotics and Automation},
YEAR year = {1986},
volume = {RA-2},
number = {1},
pages = {14-23},
month = {March},
}
@INPROCEEDINGS{survey26,
AUTHOR author = {J.Deneubourg and S.Goss and G.Sandini and F.Ferrari and P. Dario},
TITLE title =
{Self-Organizing {{Self-Organizing Collection and Transport of Objects in Unpredictable
Environments},
BOOKTITLE Environments}},
booktitle = {Japan-U.S.A. Symposium on Flexible Automation},
YEAR year = {1990},
pages = {1093-1098},
address = {Kyoto, Japan},
}
@INPROCEEDINGS{survey28,
AUTHOR author = {A.Drogoul and J.Ferber},
TITLE title =
{From {{From Tom Thumb to the Dockers: Some Experiments With Foraging
Robots},
BOOKTITLE Robots}},
booktitle = {International Conference on Simulation of Adaptive Behavior},
YEAR year = {1992},
pages = {451-459},
address = {Honolulu, Hawaii},
}
@INBOOK{survey34,
AUTHOR author = {T.Haynes and S.Sen},
TITLE title =
{Adaptation {{Adaptation and Learning in Multi-Agent
Systems},
CHAPTER Systems}},
chapter = {Evolving Behavioral Strategies in Predators and Prey},
pages = {113-126},
PUBLISHER publisher = {Springer},
YEAR year = {1986},
}
@INPROCEEDINGS{survey35,
AUTHOR author = {L.Hugues},
TITLE title =
{Collective {{Collective Grounded Representations for
Robots},
BOOKTITLE Robots}},
booktitle = {International Conference on Distributed Autonomous Robotic Systems (DARS 2000)},
YEAR year = {2000},
pages = {79-88},
}
@ARTICLE{survey36,
AUTHOR author = {D.Jung and A.Zelinsky},
TITLE title =
{Grounded {{Grounded Symbolic Communication Between Heterogeneous Cooperating
Robots},
JOURNAL Robots}},
journal = {Autonomous Robots},
YEAR year = {2000},
volume = {8},
number = {3},
pages = {269-292},
month = {July},
}
@INPROCEEDINGS{survey44,
AUTHOR author = {M.J.Mataric},
TITLE title =
{Designing {{Designing Emergent Behaviors: From Local Interactions to Collective
Intelligence},
BOOKTITLE Intelligence}},
booktitle = {International Conference on Simulation of Adaptive Behavior},
YEAR year = {1992},
editor = {J.Meyer and H.Roitblat and S.Wilson},
pages = {432-441},
address = {Honolulu, Hawaii},
publisher = {MIT Press},
}
@ARTICLE{survey51,
AUTHOR author = {E.Pagello and A.DAngelo and F.Montesello and F.Garelli and C. Ferrari},
TITLE title =
{Cooperative {{Cooperative Behaviors in Multi-Robot Systems Through Implicit
Communication},
JOURNAL Communication}},
journal = {Robotics and Autonomous Systems},
YEAR year = {1999},
volume = {29},
number = {1},
pages = {65-77},
}
@INBOOK{CC,
AUTHOR author = {I.A.~Wagner and A.M.~Bruckstein},
TITLE title =
{Communications, {{Communications, Computation, Control, and Signal Processing: A Tribute to Thomas
Kailath},
CHAPTER Kailath}},
chapter = {Cooperative Cleaners: A Case of Distributed Ant-Robotics},
pages = {289-308},
PUBLISHER publisher = {Kluwer Academic Publishers},
YEAR year = {1997},
address = {The Netherlands},
}
@book{ sgall97line, @book{sgall97line,
author =
"J. Sgall", {J. Sgall},
title =
"Line {{Line scheduling -- a survey, On-Line
Algorithms", Algorithms}},
series =
"Lecture {Lecture Notes in Computer
Science", Science},
publisher =
"Springer-Verlag, Berlin", {Springer-Verlag, Berlin},
year =
"1997"} {1997},
}
@misc{jain98stateart,
author =
"A. {A. Jain and S.
Meeran", Meeran},
title =
"A {{A state-of-the-art review of job-shop scheduling
techniques", techniques}},
text =
"Technical {Technical report, Department of Applied Physics, Electronic and Mechanical Engineering, University of Dundee, Dundee, Scotland,
1998.", 1998.},
year =
"1998", {1998},
url =
"citeseer.ist.psu.edu/jain98stateart.html" {citeseer.ist.psu.edu/jain98stateart.html},
}
@incollection{ karger97scheduling, @incollection{karger97scheduling,
author =
"D. {D. Karger and C. Stein and J.
Wein", Wein},
title =
"Scheduling algorithms", {{Scheduling algorithms}},
booktitle =
"Handbook {Handbook of Algorithms and Theory of
Computation", Computation},
publisher =
"CRC Press", {CRC Press},
editor =
"M. {M. J.
Atallah", Atallah},
year =
"1997", {1997},
url =
"citeseer.ist.psu.edu/karger97scheduling.html" {citeseer.ist.psu.edu/karger97scheduling.html},
}
@book{ Leung2004handbookOfScheduling, @book{Leung2004handbookOfScheduling,
author =
"J. {J. Leung and J. H.
Anderson", Anderson},
title =
"Handbook {{Handbook of
Scheduling", Scheduling}},
publisher =
"CRC Press", {CRC Press},
year =
"May {May 1,
2004"} 2004},
}
@inproceedings{Sorensen2003DistanceMeasuresBasedOnEditDistance,
author="K. Sorensen",
title="Distance author = {K. Sorensen},
title = {{Distance measures based on the edit distance for permutation type
representations",
booktitle="Workshop representations}},
booktitle = {Workshop on Analysis and Design of Representations and
Operators",
pages="29-35",
address="Chicago, USA.",
year= 2003} Operators},
pages = {29-35},
address = {Chicago, USA.},
year = {2003},
}
@inproceedings{Sorensen2005PermutationDistanceMeasures,
author="K. author = {K. Sorensen and M. Reimann and C.
Prins",
title="Permutation Prins},
title = {{Permutation distance measures for memetic algorithms with population
management",
booktitle="MIC management}},
booktitle = {MIC 6th Metaheuristics International
Conference",
address="Vienna, Austria",
year= 2005} Conference},
address = {Vienna, Austria},
year = {2005},
}
@book{Hausdoff1914HausdoffDistance,
author="F. Hausdorf",
title="Grundzuege author = {F. Hausdorf},
title = {{Grundzuege der
Mengenlehre",
publisher="Viet, Leipzig",
year=1914} Mengenlehre}},
publisher = {Viet, Leipzig},
year = {1914},
}
@inproceedings{ARKIN90,
author="E. author = {E. Arkin and L. P. Chew and D. P. Huttenlovher and K. Kedem and J. S. B.
Mitcjell",
title="An Mitcjell},
title = {{An efficiently computable metrics for comparing polygonal
shapes",
booktitle="ACM-SIAM shapes}},
booktitle = {ACM-SIAM Symposium on Discrete
Algoritmhs",
year= 1990}
@article {Atallah93, Algoritmhs},
year = {1990},
}
@article{Atallah93,
author =
"M. {M. J.
Atallah", Atallah},
title =
"A {{A linear time algorithm for the Hausdorff distance between convex
polygons", polygons}},
journal =
"Information {Information Processing
Letters", Letters},
volume =
"17", {17},
pages =
"207-209", {207-209},
year =
"1983"} {1983},
}
@inproceedings{REPLAN2000,
author="O. author = {O. Brock and K.
Oussama",
title="Real-Time Oussama},
title = {{Real-Time Replanning in High-Dimensional Configuration Spaces Using Sets of Homotopic
Paths",
booktitle="IEEE Paths}},
booktitle = {IEEE International Conference on Robotics and
Automation",
pages="550-555",
address="San Automation},
pages = {550-555},
address = {San Francisco,
USA",
year= 2000} USA},
year = {2000},
}
@inproceedings{ijcai03,
author =
"R. {R. E.
Korf", Korf},
title =
"Delayed {{Delayed duplicate detection: Extended
abstract", abstract}},
booktitle =
"International {International Joint Conference on Artificial Intelligence
(IJCAI-03)", (IJCAI-03)},
year =
"2003", {2003},
pages =
"1539-1541"} {1539-1541},
}
@inproceedings{ijcai07,
author =
"R. {R. E. Korf and A.
Felner", Felner},
title =
"Recent {{Recent progress in heuristic search: {A} case study of the Four-peg {Towers of Hanoi}
problem", problem}},
booktitle =
"International {International Joint Conference on Artificial Intelligence
(IJCAI-07)", (IJCAI-07)},
year =
"2007", {2007},
pages =
"2324-2329"}
@inproceedings {aaai04, {2324-2329},
}
@inproceedings{aaai04,
author =
"R. {R. E.
Korf", Korf},
title =
"Best-first {{Best-first frontier search with delayed duplicate
detection", detection}},
booktitle =
"National {National Conference on Artificial Intelligence
(AAAI-2004)", (AAAI-2004)},
pages =
"650-657", {650-657},
year =
"2004"}
@inproceedings {aaai05, {2004},
}
@inproceedings{aaai05,
author =
"R. {R. E. Korf and P.
Shultze", Shultze},
title =
"Large-scale, {{Large-scale, parallel breadth-first
search", search}},
booktitle =
"National {National Conference on Artificial Intelligence
(AAAI-2005)", (AAAI-2005)},
pages =
"1380-1385", {1380-1385},
year =
"2005"}
@article {frontier, {2005},
}
@article{frontier,
author =
"R. {R. E. Korf and W. Zhang and I. Thayer and H.
Hohwald", Hohwald},
title =
"Frontier search", {{Frontier search}},
journal =
"Journal {Journal of the
JACM",
volume = "52",
number = "5",
month = "September",
year = "2005",
pages = "715-748"}
@article {stewart,
author = "B.M. Stewart",
title = "Solution to advanced problem 3918",
journal = "American Mathematical Monthly",
volume = "48",
year = "1941",
pages = "217-219"}
@article {bfhs,
author = "R. Zhou and E. Hansen",
title = "Breadth-first heuristic search",
journal = "Artificial Intelligence",
volume = "170",
number = "4-5",
pages = "385-408",
year = "2006"}
@article{DBLP:journals/ai/Martelli77,
author = {A. Martelli},
title = {On the Complexity of Admissible Search Algorithms},
journal = {Artificial Intelligence}, JACM},
volume =
{8}, {52},
number =
{1}, {5},
month = {September},
year =
{1977}, {2005},
pages =
{1-13},
bibsource = {DBLP, http://dblp.uni-trier.de} {715-748},
}
@inproceedings {Munagala+Ranade, @article{stewart,
author =
"K. Munagala and A. Ranade", {B.M. Stewart},
title =
"I/O Complexity of graph algorithms",
booktitle {{Solution to advanced problem 3918}},
journal =
"Annual Symposium on Discrete Algorithms",
publisher {American Mathematical Monthly},
volume =
"ACM-SIAM", {48},
year =
"1999", {1941},
pages =
"687-694"}
@article {myrvold+ruskey, {217-219},
}
@article{bfhs,
author =
"W. Myrvold {R. Zhou and
F. Ruskey", E. Hansen},
title =
"Ranking and unranking permutations in linear time", {{Breadth-first heuristic search}},
journal =
"Information Processing Letters", {Artificial Intelligence},
volume =
"79", {170},
number = {4-5},
pages =
"281-284", {385-408},
year =
"2001"}
@article {lincon, {2006},
}
@article{lincon,
author =
"O. {O. Hansson and A. Mayer and M.
Yung", Yung},
title =
"Criticizing {{Criticizing solutions to relaxed models yields powerful admissible
heuristics", heuristics}},
journal =
"Information Sciences", {Information Sciences},
volume =
"63(3)", {63(3)},
pages =
"207-227", {207-227},
year =
"1992"}
@article {SKOENIG2001, {1992},
}
@article{SKOENIG2001,
author =
"S. Koenig", {S. Koenig},
title =
"Agent-Centered Search", {{Agent-Centered Search}},
journal =
"Artificial {Artificial Intelligence
Magazine", Magazine},
volume =
"22(4)",
pages = "109-131",
year = "2001"}
@inproceedings{DBLP:conf/ecml/ShaniBS06,
author = {Guy Shani and
Ronen I. Brafman and
Solomon Eyal Shimony},
title = {Prioritizing Point-Based {POMDP} Solvers},
booktitle = {ECML},
year = {2006}, {22(4)},
pages =
{389-400},
ee = {http://dx.doi.org/10.1007/11871842_38},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/ecml/2006,
editor = {Johannes F{\"u}rnkranz and
Tobias Scheffer and
Myra Spiliopoulou},
title = {Machine Learning: ECML 2006, 17th European Conference on
Machine Learning, Berlin, Germany, September 18-22, 2006,
Proceedings},
booktitle = {ECML},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {4212},
year = {2006},
isbn = {3-540-45375-X},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{DBLP:conf/aaai/Hansen07,
author = {Eric A. Hansen},
title = {Indefinite-Horizon {POMDP}s with Action-Based Termination},
booktitle = "National Conference on Artificial Intelligence (AAAI-2007)", {109-131},
year =
{2007},
pages = {1237-1242},
bibsource = {DBLP, http://dblp.uni-trier.de} {2001},
}
@book{Puterman,
author = {M.~Puterman},
title =
{Markov {{Markov Decision
Processes}, Processes}},
publisher = {Wiley},
address = {New York},
year =
{1994} {1994},
}
@inproceedings{Pineau,
author =
"J.~Pineau {J.~Pineau and G.~Gordon and
S.~Thrun", S.~Thrun},
title =
{Point-Based {{Point-Based Value Iteration: An Anytime Algorithm for
{POMDP}s}, {POMDP}s}},
month =
"August", {August},
year =
"2003",
booktitle="International {2003},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI-03)", (IJCAI-03)},
pages =
"1025 {1025 -
1032" 1032},
}
@article{HeckermanVOI,
author = {D. Heckerman and E. Horvitz and B. Middleton},
title =
{An {{An Approximate Nonmyopic Computation for Value of
Information}, Information}},
journal = {IEEE Trans. Pattern Anal. Mach. Intell.},
volume = {15},
number = {3},
year = {1993},
issn = {0162-8828},
pages = {292-298},
doi = {http://dx.doi.org/10.1109/34.204912},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA},
}
@article{DUALJUR,
author = {U. Zahavi and A. Felner and R. C. Holte and J. Schaeffer},
title =
{Duality {{Duality in permutation state spaces and the dual search
algorithm}, algorithm}},
journal = {Artificial Intelligence},
volume = {172},
number = {4-5},
year = {2008},
pages = {514-540},
ee = {http://dx.doi.org/10.1016/j.artint.2007.10.019},
bibsource = {DBLP,
http://dblp.uni-trier.de}
}
@inproceedings{DBLP:conf/aaai/Korf07,
author = {R. E. Korf},
title = {Analyzing the Performance of Pattern Database Heuristics},
booktitle = "National Conference on Artificial Intelligence (AAAI-2007)",
year = {2007},
pages = {1164-1170},
bibsource = {DBLP, http://dblp.uni-trier.de} http://dblp.uni-trier.de},
}
@article {JAIRTOBY, @article{JAIRTOBY,
author =
"B. {B. Hnich and B. Smith and T.
Walsh", Walsh},
title =
"Dual {{Dual Modelling of Permutation and Injection
Problems", Problems}},
journal =
"Journal {Journal of Artificial Intelligence
Research", Research},
volume =
"21", {21},
pages =
"357-391",
year = "2004"}
@article{DBLP:journals/ai/ZhouH06,
author = {Rong Zhou and
Eric A. Hansen},
title = {Breadth-first heuristic search},
journal = {Artificial Intelligence},
volume = {170},
number = {4-5}, {357-391},
year =
{2006},
pages = {385-408},
ee = {http://dx.doi.org/10.1016/j.artint.2005.12.002},
bibsource = {DBLP, http://dblp.uni-trier.de} {2004},
}
@article{Mahanti97,
author = {A. Mahanti and S. Ghosh and D. Nau and A. Pal and L. Kanal},
title =
{On {{On the Asymptotic Performance of
{IDA*}}, {IDA*}}},
journal = {Annals of Mathematics and Artificial Intelligence},
volume = {20},
number = {1-4},
year = {1997},
pages = {161-193},
}
@inproceedings{PRED08,
author = {U. Zahavi and A. Felner and N. Burch and R. C. Holte},
title =
{Predicting {{Predicting the Performance of {IDA*} with Conditional
Distributions}, Distributions}},
booktitle =
"National {National Conference on Artificial Intelligence
(AAAI-2008)", (AAAI-2008)},
year = {2008},
pages = {381-386},
bibsource = {DBLP,
http://dblp.uni-trier.de} http://dblp.uni-trier.de},
}
@article{JAIRAdditiveSSA,
author = {F. Yang and J. Culberson and R. C. Holte and U. Zahavi and A. Felner},
title =
{A {{A General Theory of Additive State Space
Abstractions},
journal="Journal Abstractions}},
journal = {Journal of Artificial Intelligence
Research", Research},
volume = {32},
year = {2008},
pages = {631-662},
}
@article{ADBAIJ02,
author = {R. E. Korf and A. Felner},
title =
{Disjoint {{Disjoint pattern database
heuristics}, heuristics}},
journal = {Artificial Intelligence},
volume = {134},
number = {1-2},
year = {2002},
pages = {9-22},
ee = {http://dx.doi.org/10.1016/S0004-3702(01)00092-3},
bibsource = {DBLP,
http://dblp.uni-trier.de} http://dblp.uni-trier.de},
}
@mastersthesis{ZhangMaster08,
author="Z. Zhang",
title="Single author = {Z. Zhang},
title = {{Single Agent Search with Addmissible Inconsistent
Heuristics",
school="Department Heuristics}},
school = {Department of Computer Science, University of
Alberta",
address="Canada",
year=2008} Alberta},
address = {Canada},
year = {2008},
}
@InProceedings{CPDBsara,
author =
"A. {A. Felner and N. Sturtevant and J.
Schaeffer ", Schaeffer},
title =
"Abstraction-Based {{Abstraction-Based Heuristics with True Distance
Computations",
booktitle="Symposium Computations}},
booktitle = {Symposium on Abstraction, Reformulation and Approximation
(SARA-09)", (SARA-09)},
year =
"2009" {2009},
}
@InProceedings{CPDB,
author =
"N. {N. Sturtevant and A. Felner and M. Barer and J. Schaeffer and N.
Burch", Burch},
title =
"Memory-Based {{Memory-Based Heuristics for Explicit State
Spaces",
booktitle="International Spaces}},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI-09)", (IJCAI-09)},
pages =
"609-614", {609-614},
year =
"2009" {2009},
}
@InProceedings{IncAStar,
author =
"Z. {Z. Zhang and N. Sturtevant and J. Schaeffer and R.C. Holte and A.
Felner", Felner},
title =
"{A*} {{{A*} Search with Inconsistent
Heuristics",
booktitle="International Heuristics}},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI-09)",
pages= "634-639", (IJCAI-09)},
pages = {634-639},
year =
"2009", {2009},
}
@inproceedings{BONET2006,
author = {B. Bonet and H. Geffner},
title =
{Learning {{Learning Depth-First Search: A Unified Approach to Heuristic Search in Deterministic and Non-Deterministic
Settings, Settings and Its Application to
{MDP}s}, {MDP}s}},
booktitle =
"International {International Conference on Automated Planning and Scheduling
(ICAPS-06)", (ICAPS-06)},
year = {2006},
pages = {142-151},
}
@inproceedings{Domshlak2010,
author = {Carmel Domshlak and Erez Karpas and Shaul Markovitch},
title =
{To {{To Max or not to Max: Online Learning for Speeding Up Optimal
Planning}, Planning}},
booktitle = {AAAI},
pages = {1071-1077},
year =
{2010} {2010},
}
@inproceedings{surynek2010anOptimization,
author = {Surynek, Pavel},
booktitle = {AAAI},
title =
{An {{An Optimization Variant of Multi-Robot Path Planning Is
Intractable}, Intractable}},
pages = {1271 - 1273},
year =
{2010} {2010},
}
@article{mackworth1977consistency,
author = {Mackworth, Alan K.},
interhash = {0c6134708e96f96551ccde97f3f0b103},
intrahash = {651b831cbd560e77f934959bad74f926},
journal = {Artif. Intell.},
number =
1, {1},
pages = {99-118},
title =
{Consistency {{Consistency in Networks of
Relations}, Relations}},
volume =
8, {8},
year =
1977 {1977},
}
@article{lavalle96optimalmotion,
author = {Lavalle, Steven M. and Hutchinson, Seth A.},
interhash = {b1991765ca05d5f4d05a4abd8bed2d9f},
intrahash = {368b296b58270e4b266113081555fbf3},
journal = {IEEE Trans. on Robotics and Automation},
pages = {912--925},
title =
{Optimal {{Optimal Motion Planning for Multiple Robots Having Independent
Goals}, Goals}},
volume =
14, {14},
year = {1998},
}
@inproceedings{kornhauser1984coordinating,
title = {{Coordinating Pebble Motion On Graphs, The Diameter Of Permutation Groups, And Applications}},
author = {Daniel Kornhauser, Gary Miller, Paul Spirakis},
booktitle = {Symposium on Foundations of Computer Science},
pages = {241--250},
year =
1998 {1984},
organization = {IEEE},
}
