2000 character limit reached
Dynamic programming with incomplete information to overcome navigational uncertainty in a nautical environment
Published 29 Dec 2021 in math.OC and cs.AI | (2112.14657v2)
Abstract: Using a novel toy nautical navigation environment, we show that dynamic programming can be used when only incomplete information about a partially observed Markov decision process (POMDP) is known. By incorporating uncertainty into our model, we show that navigation policies can be constructed that maintain safety, outperforming the baseline performance of traditional dynamic programming for Markov decision processes (MDPs). Adding in controlled sensing methods, we show that these policies can also lower measurement costs at the same time.
Paper Prompts
Sign up for free to create and run prompts on this paper.