Package edu.columbia.cs.coms4701.search.online

R&N ch 4.5: Search in partially observable environments, in which planning and action must be interleaved.

See:
          Description

Interface Summary
LRTAStarAgentProgram<K extends AgentAction,P extends AgentPercept,S extends AgentState> An online agent that uses an A*-like evaluation function.
OnlineAgentProgram<K extends AgentAction,P extends AgentPercept,S extends AgentState> Like a SimpleProblemSolvingAgent, but adapted for the information available in an online environment.
OnlineDFSAgentProgram<K extends AgentAction,P extends AgentPercept,S extends AgentState> An online search agent program that uses depth-first exploration.
OnlineGreedyAgentProgram<K extends AgentAction,P extends AgentPercept,S extends AgentState> An agent program which implements an online version of the Greedy Best-First informed search algorithm.
OnlineHeuristicAgentProgram<K extends AgentAction,P extends AgentPercept,S extends AgentState,R extends OnlineSearchProblem<K,S>> An online search agent that uses an evaluation function to choose actions.
OnlineHeuristicFunction<K extends AgentAction,S extends AgentState,P extends OnlineSearchProblem<K,S>> A heuristic function in an online environment directly evaluates states, rather than search tree nodes.
OnlineSearchProblem<K extends AgentAction,S extends AgentState> A formal description of the information available to an online search agent.
OnlineSearchProblemWithSuccessorFunction<K extends AgentAction,S extends AgentState> An online problem description in which the agent does know, at least provisionally, the outcome of a given action from a given state.
 

Package edu.columbia.cs.coms4701.search.online Description

R&N ch 4.5: Search in partially observable environments, in which planning and action must be interleaved.

Related Documentation