1. Does the planner jar you gave us support in preconditions? I seam to get error on the ones that is available in http://planning.cis.strath.ac.uk/competition/domains.html (UMTranslog-2)
Here is my code:
:precondition (and (at ?p) (or (connected ?h ?p) (connected ?p ?h)))
Exception while parsing domain robby!
edu.asu.sapa.parsing.ParseException: Encountered "(" at line 13, column 29.
It works if I change to and instead of or.
2. Is there a way to give or in the parameters? For example Report needs to take in room and hallway. Currently I solved it using two actions report-room and report-hallway. I feel there should be a better way.
I checked the tutorials you had attached in the bottom of the project description. I couldn't find direct answer to my question there which is why I am mailing you.
Here is a mr. poll link where you can give anonymous text-based feedback on the course.
<Removed from Blog; see email for link>
I encourage you to participate in it.
Hi all:I have created a link on Blackboard so that you can submit your Project-1 *code* (your report should be submitted before class, and in hard-copy). Please name your file as <first_name>_<last_name>.lisp.And as a reminder: the "early" deadline is 4:30pm, 2/14; and the extended one is exactly one week later.Please let me know if you have any question.Thanks,Tuan
Is this BYENG or BYAC?--On Thu, Feb 2, 2012 at 6:12 PM, Subbarao Kambhampati <firstname.lastname@example.org> wrote:
Just a reminder that Friday (tomorrow's) make-up class is going to be in BY 210.It will be from 10AM to 11:15AM.Rao
Ivan ZhouGraduate StudentGraduate Professional Student Association (GPSA) Assembly MemberEta Kappa Nu (HKN) Active MemberSchool of Computing, Informatics and Decision Systems EngineeringIra A. Fulton School of EngineeringArizona State University
For each of the following statements below, indicate whether the statement is true or false, and give a brief but precise justification for your answer. Correct answers *with correct justifications* will carry 2points. No points will be awarded for answers without correct justifications. Example qn: The time and memory requirements of IDA* can be improved by using A* algorithm to do search in individual iterations. Answer: False. Because A* in the worst case can take as much memory as breadth-first, and thus using A* in the individual iterations will make IDA* require exponential memory (instead of linear memory). A. A* search does b^(d/2) node expansions when searching a unifrom tree of branching factor b and depth d, using a perfect heuristic. B. Consider a uniform search tree of depth d and branching factor b, where there are many goal nodes, all of which are uniformly distributed at the leaf level d. Assuming that memory consumption is not a problem, we are better off using breadth-first search than depth-first search in this scenario. C. A* search with heuristic h=0 will always have to search the entire tree before finding the optimal solution. D. Suppose A* search uses an evaluation function f(n) = (1-w) g(n) + w h(n). For any value of w between 0 and 1 (inclusive), A* will terminate and return optimal solution. E. If h1 and h2 are two admissible heuristics, and h3 is defined as h3(n) = max(h1(n) , h2(n)) , then A* search with h3 is guaranteed to return an optimal solution while expanding as many or fewer nodes than either h1 or h2.