部分可观察规划问题的算法

The project hosts two planners for solving partially observable planning problems: cp2fsc and K-Replanner. cp2fsc It is an automated tool for generating finite-state controllers (FSCs) for partially observable problems. The FSCs are Mealy machines whose transitions, conditional on observations, dictate the actions to apply in the environment. In order to synthetise the FSC, the control problem (CP) is translated into a conformant problem and then into a classical planning problem. The solution of the classical problem define the FSC for the control problem. Quite ofter, the FSC also works for control problems different from the input with respect to size, presence of non-deterministic actions or exogenous events. For more details, see B. Bonet, H. Palacios and H. Geffner. Automatic Derivation of Memoryless Policies and Finite-State Controllers Using Classical Planners. Proc

bison++-1.21-8
allocate.c
mkinstalldirs
bison.info-3
warshall.c
files.c
ChangeLog
bison_pp.mak
gram.h
symtab.c
symtab.h
bison.rnh
bison.cld
config.status
version.c
new.h
reader.c
files.h
bison.info-4
REFERENCES
configure.in
build.com
lr0.c
configure.bat
texinfo.tex
print.c
bison.info-2
lex.c
Makefile
main.c
gram.c
README
bison.info
vmshlp.mar
vmsgetargs.c
INSTALL
Makefile.in
bison.h
getargs.c
reduce.c
lalr.c
getopt.h
state.h
machine.h
COPYING
Notes.txt
bison.hairy
bison.texinfo
bison.1
conflict.c
bison.info-1
bison.cc
derives.c
bison++.1
alloca.c
types.h
lex.h
output.c
getopt1.c
closure.c
getopt.c
system.h
bison++.1.dman
nullable.c
configure