BibTeX references related to crossroads scheduling

Russell & Norvig, Artificial Intelligence: A Modern Approach

@Book{Russell2003, 
   AUTHOR = {Stuart Russell and Peter Norvig},
   TITLE = {Artificial Intelligence: A Modern Approach},
   PUBLISHER = {Prentice-Hall, Englewood Cliffs, NJ},
   YEAR = {2003},
   EDITION = {2nd edition}
}
@inBook{Russell2003Constraints,
   AUTHOR = {Stuart Russell and Peter Norvig},
   TITLE = {Artificial Intelligence: A Modern Approach},
   CHAPTER = {Constraints Satisfaction Problems},
   PAGES = {137-160},
   PUBLISHER = {Prentice-Hall, Englewood Cliffs, NJ},
   YEAR = {2003},
   EDITION = {2nd edition}
}
@inBook{Russell2003Planning, 
   AUTHOR = {Stuart Russell and Peter Norvig},
   TITLE = {Artificial Intelligence: A Modern Approach},
   CHAPTER = {Planning},
   PAGES = {375-416},
   PUBLISHER = {Prentice-Hall, Englewood Cliffs, NJ},
   YEAR = {2003},
   EDITION = {2nd edition}
}

CSP

@ARTICLE{BisMR97,
author = {S. Bistarelli and U. Montanari and F. Rossi},
title = {Semiring-based constraint satisfaction and optimization},
journal = {Journal of the Association for Computing Machinery},
year = {1997},
volume = {44},
number = {2}
}
@article{361224,
 author = {James R. Bitner and Edward M. Reingold},
 title = {Backtrack programming techniques},
 journal = {Commun. ACM},
 volume = {18},
 number = {11},
 year = {1975},
 issn = {0001-0782},
 pages = {651--656},
 doi = {http://doi.acm.org/10.1145/361219.361224},
 publisher = {ACM Press},
 address = {New York, NY, USA},
 }
@article{359101,
 author = {Daniel Br\&\#233;laz},
 title = {New methods to color the vertices of a graph},
 journal = {Commun. ACM},
 volume = {22},
 number = {4},
 year = {1979},
 issn = {0001-0782},
 pages = {251--256},
 doi = {http://doi.acm.org/10.1145/359094.359101},
 publisher = {ACM Press},
 address = {New York, NY, USA},
 }
@misc{ dechter99bucket,
  author = "R. Dechter",
  title = "Bucket elimination: A unifying framework for reasoning",
  text = "R. Dechter, Bucket elimination: A unifying framework for reasoning, Articial
    Intelligence 113, (1999), 41-85.",
  year = "1999",
  url = "citeseer.ifi.unizh.ch/article/dechter99bucket.html" }
@inproceedings{Haralick:79IJ,
  AUTHOR = {R. M. Haralick and G. L. Elliott},
  TITLE = {Increasing Tree Search Efficiency for Constraint Satisfaction Problems},
  YEAR = 1979,
  BOOKTITLE = {Proc. of the 6th IJCAI},
  ADDRESS = "Tokio, Japan",
  PAGES = {356-364},
  KEYWORDS = {}}
@article{ kirkpatrick83optimization,
    author = "S. Kirkpatrick and C. D. Gelatt and M. P. Vecchi",
    title = "Optimization by Simulated Annealing",
    journal = "Science, Number 4598, 13 May 1983",
    volume = "220, 4598",
    pages = "671--680",
    year = "1983",
    url = "citeseer.ist.psu.edu/kirkpatrick83optimization.html" }
@inproceedings{ kambhampati96formalizing,
    author = "Subbarao Kambhampati",
    title = "Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search",
    booktitle = "{AAAI}/{IAAI}, Vol. 1",
    pages = "757-762",
    year = "1996",
    url = "citeseer.ist.psu.edu/kambhampati96formalizing.html" }
@Article{Mackworth:1977,
  author  = "Alan K. Mackworth",
  title   = "Consistency in Networks of Relations",
  journal = AI,
  volume  = 8,
  number  = 1,
  year    = 1977,
  pages   = "99--118"
}
@Article{Mohr86:arcpath,
  author    = "Mohr, R. and Henderson, T.C.",
  title     = {Arc and Path Consistency Revisited},
  journal   = {Artificial Intelligence},
  year      = 1986,
  volume    = 28,
  number    = 2,
  pages     = {225--233},
  contentnote   = {Abstract: Mackworth and Freuder have analyzed the time
          complexity of several constraint satisfaction algorithms
          [5]. We present here new algorithms for arc and path
          consistency and show that the arc consistency algorithm is
          optimal in time complexity and of the same-order space
          complexity as the earlier algorithms. A refined solution
          for the path consistency problem is proposed. However, the
          space complexity of the path consistency algorithm makes it
          practicable only for small problems. These algorithms are
          the result of the synthesis techniques used in ALICE (a
          general constraint satisfaction system) and local
          consistency methods [3].},
  topic     = {arc-(in)consistency;consistency-checking;
          constraint-satisfaction;}
}
@article{DBLP:journals/ai/MintonJPL92,
  author    = {Steven Minton and
               Mark D. Johnston and
               Andrew B. Philips and
               Philip Laird},
  title     = {Minimizing Conflicts: A Heuristic Repair Method for Constraint
               Satisfaction and Scheduling Problems.},
  journal   = {Artif. Intell.},
  volume    = {58},
  number    = {1-3},
  year      = {1992},
  pages     = {161-205},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
@misc{ sabin94contradicting,
  author = "D. Sabin and E. Freuder",
  title = "Contradicting conventional wisdom in constraint satisfaction",
  text = "D. Sabin and E.C. Freuder. Contradicting conventional wisdom in constraint
    satisfaction. In Proceedings of ECAI-94, pages 125--129, 1994.",
  year = "1994",
  url = "citeseer.ifi.unizh.ch/sabin94contradicting.html" }
@misc{ sabin97understanding,
  author = "D. Sabin and E. Freuder",
  title = "Understanding and Improving the MAC Algorithm",
  text = "Daniel Sabin and Eugene C. Freuder. Understanding and Improving the MAC
    Algorithm. In Proceedings of the Third International Conference on Principles
    and Practice of Constraint Programming, pages 167--181, Linz, Austria, 1997.",
  year = "1997",
  url = "citeseer.ifi.unizh.ch/sabin97understanding.html" }
@article{DBLP:journals/ai/StallmanS77,
  author    = {Richard M. Stallman and
               Gerald J. Sussman},
  title     = {Forward Reasoning and Dependency-Directed Backtracking in
               a System for Computer-Aided Circuit Analysis.},
  journal   = {Artif. Intell.},
  volume    = {9},
  number    = {2},
  year      = {1977},
  pages     = {135-196},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Traffic lights

@inproceedings{313892,
 author = {Sandy Irani and Vitus Leung},
 title = {Scheduling with conflicts, and applications to traffic signal control},
 booktitle = {SODA '96: Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms},
 year = {1996},
 isbn = {0-89871-366-8},
 pages = {85--94},
 location = {Atlanta, Georgia, United States},
 publisher = {Society for Industrial and Applied Mathematics},
 address = {Philadelphia, PA, USA},
 }
@ARTICLE{gershenson-2004-16,
  author = {Carlos Gershenson},
  title = {Self-Organizing Traffic Lights},
  journal = {COMPLEX SYSTEMS},
  volume = {16},
  pages = {29},
  url = {http://www.citebase.org/cgi-bin/citations?id=oai:arXiv.org:nlin/0411066},
  year = {2004}
}
@INPROCEEDINGS{2004aamas-dresner,
  author = {Kurt Dresner and Peter Stone},
  title = {Multiagent Traffic Management: A Reservation-Based Intersection Control Mechanism},
  booktitle = {The Third International Joint Conference on Autonomous Agents and Multiagent Systems},
  year = {2004},
  month = {July},
  pages = {530-537},
  address = "New York, New York, USA",
  abstract = {
Traffic congestion is one of the leading causes of lost productivity
and decreased standard of living in urban settings.  Recent advances
in artificial intelligence suggest vehicle navigation by autonomous
agents will be possible in the near future.  In this paper, we propose
a reservation-based system for alleviating traffic congestion, specifically
at intersections, and under the assumption that the cars are controlled
by agents.  First, we describe a custom simulator that we have created
to measure the different delays associated with conducting traffic
through an intersection.  Second, we specify a precise metric for
evaluating the quality of traffic control at an intersection.  Using
this simulator and this metric, we show that our reservation-based
system can perform two to three hundred times better than traffic
lights.  As a result, it can smoothly handle much heavier traffic
conditions.  We show that our system very closely approximates an
overpass, which is the optimal solution for the problem with which
we are dealing.},
   wwwnote={<a href="http://www.aamas-conference.org/">AAMAS 2004</a>},
   bib2html_rescat = {Autonomous Intersection Management},
   bib2html_pubtype = {Refereed Conference}
}
@INPROCEEDINGS{2005aamas-dresner,
  author = {Kurt Dresner and Peter Stone},
  title = {Multiagent Traffic Management: An Improved Intersection Control Mechanism},
  booktitle = {The Fourth International Joint Conference on Autonomous Agents and
	Multiagent Systems},
  year = {2005},
  pages = {471--477},
  month = {July},
  address = "Utrecht, The Netherlands",
  abstract = {
Traffic congestion is one of the leading causes of lost productivity
and decreased standard of living in urban settings.  Recent advances
in artificial intelligence suggest vehicle navigation by autonomous
agents will be possible in the near future.  In previous work, a
reservation-based system for alleviating traffic congestion, specifically
at intersections was proposed.  This paper extends that prototype
implementation in several ways with the aim of making it more implementable
in the real world.  In particular, we (1) add the ability of vehicles
to turn, (2) enable them to accelerate while in the intersection,
and (3) augment their interaction capabilities with a detailed protocol
such that the vehicles do not need to know anything about the intersection
control policy.  The use of this protocol limits the interaction
of the driver agent and the intersection manager to the extent that
it is a reasonable approximation of reliable wireless communication.
 Finally, we describe how different intersection control policies
can be expressed with this protocol and limited exchange of information.
 All three improvements are fully implemented and tested, and we
present detailed empirical results validating their effectiveness.},
   wwwnote={<a href="http://www.aamas2005.nl/">AAMAS 2005</a>},
   bib2html_rescat = {Autonomous Intersection Management},
   bib2html_pubtype = {Refereed Conference}
}
 
wiki/old/users/oliviermehani/mscthesisbibtexreferences.txt · Last modified: 2009/11/17 22:56 (external edit)
Recent changes · Show pagesource · Login