{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AGVZHVWWNQZA5ARX7HIUAYOY25","short_pith_number":"pith:AGVZHVWW","schema_version":"1.0","canonical_sha256":"01ab93d6d66c320e8237f9d14061d8d769796dfb2d2913b76c6af5496e1d3897","source":{"kind":"arxiv","id":"1805.12343","version":1},"attestation_state":"computed","paper":{"title":"Least-square based recursive optimization for distance-based source localization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Lihua Xie, Thien-Minh Nguyen","submitted_at":"2018-05-31T07:01:53Z","abstract_excerpt":"In this paper we study the problem of driving an agent to an unknown source whose location is estimated in real-time by a recursive optimization algorithm. The optimization criterion is subject to a least-square cost function constructed from the distance measurements to the target combined with the agent's self-odometry. In this work, two important issues concerning real world application are directly addressed, which is a discrete-time recursive algorithm for concurrent control and estimation, and consideration for input saturation. It is proven that with proper choices of the system's param"},"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":"1805.12343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-05-31T07:01:53Z","cross_cats_sorted":[],"title_canon_sha256":"5bc03ccf9dc805b6d8d5b48450c7ea8ddc1809cf415a89098688bfe50ca7024e","abstract_canon_sha256":"4b2593c8e821fcbe1ddc802687346828324b9f85d0d75bd55e3b69ba9ce26c15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:53.309554Z","signature_b64":"Zben6/wvb9M0yM9Pm27LES0roIHiAfi8tclDt+caHEuh3borElkgyWN5z7xIZ/1dRpNMml6T5J5isE9FFBwABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01ab93d6d66c320e8237f9d14061d8d769796dfb2d2913b76c6af5496e1d3897","last_reissued_at":"2026-05-17T23:56:53.309102Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:53.309102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Least-square based recursive optimization for distance-based source localization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Lihua Xie, Thien-Minh Nguyen","submitted_at":"2018-05-31T07:01:53Z","abstract_excerpt":"In this paper we study the problem of driving an agent to an unknown source whose location is estimated in real-time by a recursive optimization algorithm. The optimization criterion is subject to a least-square cost function constructed from the distance measurements to the target combined with the agent's self-odometry. In this work, two important issues concerning real world application are directly addressed, which is a discrete-time recursive algorithm for concurrent control and estimation, and consideration for input saturation. It is proven that with proper choices of the system's param"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12343","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":"1805.12343","created_at":"2026-05-17T23:56:53.309174+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.12343v1","created_at":"2026-05-17T23:56:53.309174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12343","created_at":"2026-05-17T23:56:53.309174+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGVZHVWWNQZA","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGVZHVWWNQZA5ARX","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGVZHVWW","created_at":"2026-05-18T12:32:13.499390+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/AGVZHVWWNQZA5ARX7HIUAYOY25","json":"https://pith.science/pith/AGVZHVWWNQZA5ARX7HIUAYOY25.json","graph_json":"https://pith.science/api/pith-number/AGVZHVWWNQZA5ARX7HIUAYOY25/graph.json","events_json":"https://pith.science/api/pith-number/AGVZHVWWNQZA5ARX7HIUAYOY25/events.json","paper":"https://pith.science/paper/AGVZHVWW"},"agent_actions":{"view_html":"https://pith.science/pith/AGVZHVWWNQZA5ARX7HIUAYOY25","download_json":"https://pith.science/pith/AGVZHVWWNQZA5ARX7HIUAYOY25.json","view_paper":"https://pith.science/paper/AGVZHVWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.12343&json=true","fetch_graph":"https://pith.science/api/pith-number/AGVZHVWWNQZA5ARX7HIUAYOY25/graph.json","fetch_events":"https://pith.science/api/pith-number/AGVZHVWWNQZA5ARX7HIUAYOY25/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGVZHVWWNQZA5ARX7HIUAYOY25/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGVZHVWWNQZA5ARX7HIUAYOY25/action/storage_attestation","attest_author":"https://pith.science/pith/AGVZHVWWNQZA5ARX7HIUAYOY25/action/author_attestation","sign_citation":"https://pith.science/pith/AGVZHVWWNQZA5ARX7HIUAYOY25/action/citation_signature","submit_replication":"https://pith.science/pith/AGVZHVWWNQZA5ARX7HIUAYOY25/action/replication_record"}},"created_at":"2026-05-17T23:56:53.309174+00:00","updated_at":"2026-05-17T23:56:53.309174+00:00"}