{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AH7ID4XYPWYQLMJ3VU4YB64LN5","short_pith_number":"pith:AH7ID4XY","schema_version":"1.0","canonical_sha256":"01fe81f2f87db105b13bad3980fb8b6f627127082db7df963977557601307d2a","source":{"kind":"arxiv","id":"1208.5855","version":1},"attestation_state":"computed","paper":{"title":"Attraction-Based Receding Horizon Path Planning with Temporal Logic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ivana Cerna, Jana Tumova, Jiri Barnat, Maria Svorenova","submitted_at":"2012-08-29T08:13:24Z","abstract_excerpt":"Our goal in this paper is to plan the motion of a robot in a partitioned environment with dynamically changing, locally sensed rewards. We assume that arbitrary assumptions on the reward dynamics can be given. The robot aims to accomplish a high-level temporal logic surveillance mission and to locally optimize the collection of the rewards in the visited regions. These two objectives often conflict and only a compromise between them can be reached. We address this issue by taking into consideration a user-defined preference function that captures the trade-off between the importance of collect"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1208.5855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-08-29T08:13:24Z","cross_cats_sorted":[],"title_canon_sha256":"f9350f55937843ddc381c375722376a73a5a0464c2647791384e438fa163e373","abstract_canon_sha256":"95e0cae1f9b9b197245658af9046fe4b95f00a221a2ba3491a312a6834735eea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:48.531124Z","signature_b64":"3solhc8DL0UEZkZNiOiFHEv/MmgW2JfNmKdEzU5o7NYkaPJYXAmnxkCmwKIePo3jzj8xpgoSTbfPD4Haw3faDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01fe81f2f87db105b13bad3980fb8b6f627127082db7df963977557601307d2a","last_reissued_at":"2026-05-18T03:46:48.530207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:48.530207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Attraction-Based Receding Horizon Path Planning with Temporal Logic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ivana Cerna, Jana Tumova, Jiri Barnat, Maria Svorenova","submitted_at":"2012-08-29T08:13:24Z","abstract_excerpt":"Our goal in this paper is to plan the motion of a robot in a partitioned environment with dynamically changing, locally sensed rewards. We assume that arbitrary assumptions on the reward dynamics can be given. The robot aims to accomplish a high-level temporal logic surveillance mission and to locally optimize the collection of the rewards in the visited regions. These two objectives often conflict and only a compromise between them can be reached. We address this issue by taking into consideration a user-defined preference function that captures the trade-off between the importance of collect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5855","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1208.5855","created_at":"2026-05-18T03:46:48.530362+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.5855v1","created_at":"2026-05-18T03:46:48.530362+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5855","created_at":"2026-05-18T03:46:48.530362+00:00"},{"alias_kind":"pith_short_12","alias_value":"AH7ID4XYPWYQ","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"AH7ID4XYPWYQLMJ3","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"AH7ID4XY","created_at":"2026-05-18T12:26:58.693483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AH7ID4XYPWYQLMJ3VU4YB64LN5","json":"https://pith.science/pith/AH7ID4XYPWYQLMJ3VU4YB64LN5.json","graph_json":"https://pith.science/api/pith-number/AH7ID4XYPWYQLMJ3VU4YB64LN5/graph.json","events_json":"https://pith.science/api/pith-number/AH7ID4XYPWYQLMJ3VU4YB64LN5/events.json","paper":"https://pith.science/paper/AH7ID4XY"},"agent_actions":{"view_html":"https://pith.science/pith/AH7ID4XYPWYQLMJ3VU4YB64LN5","download_json":"https://pith.science/pith/AH7ID4XYPWYQLMJ3VU4YB64LN5.json","view_paper":"https://pith.science/paper/AH7ID4XY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.5855&json=true","fetch_graph":"https://pith.science/api/pith-number/AH7ID4XYPWYQLMJ3VU4YB64LN5/graph.json","fetch_events":"https://pith.science/api/pith-number/AH7ID4XYPWYQLMJ3VU4YB64LN5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AH7ID4XYPWYQLMJ3VU4YB64LN5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AH7ID4XYPWYQLMJ3VU4YB64LN5/action/storage_attestation","attest_author":"https://pith.science/pith/AH7ID4XYPWYQLMJ3VU4YB64LN5/action/author_attestation","sign_citation":"https://pith.science/pith/AH7ID4XYPWYQLMJ3VU4YB64LN5/action/citation_signature","submit_replication":"https://pith.science/pith/AH7ID4XYPWYQLMJ3VU4YB64LN5/action/replication_record"}},"created_at":"2026-05-18T03:46:48.530362+00:00","updated_at":"2026-05-18T03:46:48.530362+00:00"}