[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
an efficient temporal planner for handling required concurrency..
- To: "Rao Kambhampati" <rao@asu.edu>
- Subject: an efficient temporal planner for handling required concurrency..
- From: "Subbarao Kambhampati" <rao@asu.edu>
- Date: Wed, 16 Apr 2008 09:15:25 -0700
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=domainkey-signature:received:received:message-id:date:from:sender:to:subject:mime-version:content-type:x-google-sender-auth; bh=OLB6w9fTDmexzJaAw+KO3usqc+HBz2tVfj/j43xsnoc=; b=j6ZukkWxbaLcDB4vi0HXE/p9iD20NSTjwMBNFoEzZdB2tIFNS45OF0xY+kK5vPdBMo0FJkkX0mWceu3FgpvLSLI/YrzF5+m9HkpMafYJEouxuzi4MD3SBCvMXqkcUr0JuIaeEUB3SFMbg/rT2Bd2ZvNMhmKQhbdCMpvW3K/xXlI=
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:sender:to:subject:mime-version:content-type:x-google-sender-auth; b=afV8PukOMlbbjNr/QEwATeoGkxH4q2k94/bM9MQoYHA5lr/WMLl3Eky1Eiua+j89afLvXYNYjVJDqqHRDKU882Nfu4oHAdc9WnDvLseiwQMVnJM1D1jmxLp794mieVJvy8twfKPYj/1P64SY/BcEsH2NyKMCF+JgFgcgR5wuJbg=
- Sender: subbarao2z2@gmail.com
Here is a planner to appear in AAAI that realizes Tempo (described in the temporal planning paper you read) and
shows that it is efficient (recall that VHPOP like planners could already solve RC problems--while
DEP planners couldn't. Tempo was supposed to be a way of combining reachability heuristics with non-DEP
search space. this planner--Crikey3--realizes Tempo by making several interesting improvements to
SAPA's relaxed plan graph heuristics).
FYI
rao
http://www.cis.strath.ac.uk/cis/research/publications/papers/strath_cis_publication_2248.pdf