Pith. sign in

REVIEW 1 cited by

Dynamic programming with incomplete information to overcome navigational uncertainty in a nautical environment

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2112.14657 v2 pith:3HHGAN5Z submitted 2021-12-29 math.OC cs.AI

classification math.OCcs.AI
keywords dynamicprogrammingdecisionenvironmentincompleteinformationmarkovnautical
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Optimizing Sensor Redundancy in Sequential Decision-Making Problems

    cs.RO 2024-12 conditional novelty 6.0 of 10

    SensorOpt formulates backup sensor selection for RL policies as a budget-constrained QUBO using a second-order return approximation, and finds near-optimal configurations with Tabu Search.

Pith tools