Welcome to D
SIGMOD 2004
PODS 2004
SIGMOD RECOR
CIKM 2004
DASFAA 2004
DBPL 2003
DE-BULLETIN
DEBS 2004
DMKD 2004
DMSN 2004
DOLAP 2004
DPDJ 2004
EDBT 2004
ER 2003
GIS 2004
HDP 2004
HYPERTEXT 20
ICDE 2004
ICDT 2003
JCDL 2004
MDM
MIR 2004
MIS 2004
MMDB 2004
MOBIDE 2003
RIDE 2004
SBBD 2003
SIGIR FORUM
SIGIR 2004
SIGKDD EXPLO
SIGKDD 2004
SSDBM 2004
SSTD 2003
TIME 2004
<<< = TIME'04 Pape>>>
TODS 2004
VLDB 2004
VLDB Journal
WEBDB 2004
WIDM 2004
XIME-P 2004
Footer

The Many Ways of Facing Temporal Uncertainty in Planning and Scheduling


Thierry Vidal

  View Paper (PDF)  

Return to Invited Talks


Abstract

Generating off line a plan of activities before executing it on line is no longer realistic when one expects disturbances from an uncertain environment. Focusing on temporal plans and uncertain temporal constraints, we will show that there are three main ways of tackling the issue: the reactive way, the proactive way and the progressive way, which will be illustrated through existing models and systems. In realistic applications, one usually needs all of them, requiring a unified model. Such a model will be introduced together with the first results of a modular system developped in the ILOG programming environment.

BIBTEX


@inproceedings{DBLP:conf/time/Vidal04,    author    = {Thierry Vidal},
   title     = {The Many Ways of Facing Temporal Uncertainty in Planning
                and Scheduling.},
   booktitle = {TIME},
   year      = {2004},
   pages     = {9-10},
   ee        = {http://csdl.computer.org/comp/proceedings/time/2004/2155/00/21550009abs.htm},
   crossref  = {conf/time/2004},
   bibsource = {DBLP, http://dblp.uni-trier.de}  }  @proceedings{DBLP:conf/time/2004,    title     = {11th International Symposium on Temporal Representation
                and Reasoning (TIME 2004), 1-3 July 2004, Tatihou Island,
                Normandie, France},
   booktitle = {TIME},
   publisher = {IEEE Computer Society},
   year      = {2004},
   isbn      = {0-7695-2155-X},
   bibsource = {DBLP, http://dblp.uni-trier.de}  } },



©2005 Association for Computing Machinery