{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RDNHAYKJCTJOHTB2PG76MKBQRB","short_pith_number":"pith:RDNHAYKJ","schema_version":"1.0","canonical_sha256":"88da70614914d2e3cc3a79bfe62830887c1183f54594895c3f210eef7d794b67","source":{"kind":"arxiv","id":"1803.09493","version":3},"attestation_state":"computed","paper":{"title":"Manipulability Maximization Using Continuous-Time Gaussian Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Filip Mari\\'c, Ivan Petrovi\\'c, Jonathan Kelly, Luka Petrovi\\'c, Oliver Limoyo","submitted_at":"2018-03-26T10:04:54Z","abstract_excerpt":"A significant challenge in motion planning is to avoid being in or near \\emph{singular configurations} (\\textit{singularities}), that is, joint configurations that result in the loss of the ability to move in certain directions in task space. A robotic system's capacity for motion is reduced even in regions that are in close proximity to (i.e., neighbouring) a singularity. In this work we examine singularity avoidance in a motion planning context, finding trajectories which minimize proximity to singular regions, subject to constraints. We define a manipulability-based likelihood associated wi"},"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":"1803.09493","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-26T10:04:54Z","cross_cats_sorted":[],"title_canon_sha256":"42419c4b9f0126607558104e86284d5cdfb81f3dd521f0b75cb3dac9c3065454","abstract_canon_sha256":"2f9eccf2ed885ef40cda2a6e930e470303f70442e6204372403bc1f588e991dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:04.692623Z","signature_b64":"zguTZCy45448Qvx6aRbzCG3k+gfHCEYceI5I6ZJq8dUp998bWH3/lQ92cojY2jgff/tsy3lGaSG3ozYBacglCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88da70614914d2e3cc3a79bfe62830887c1183f54594895c3f210eef7d794b67","last_reissued_at":"2026-05-18T00:06:04.692145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:04.692145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Manipulability Maximization Using Continuous-Time Gaussian Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Filip Mari\\'c, Ivan Petrovi\\'c, Jonathan Kelly, Luka Petrovi\\'c, Oliver Limoyo","submitted_at":"2018-03-26T10:04:54Z","abstract_excerpt":"A significant challenge in motion planning is to avoid being in or near \\emph{singular configurations} (\\textit{singularities}), that is, joint configurations that result in the loss of the ability to move in certain directions in task space. A robotic system's capacity for motion is reduced even in regions that are in close proximity to (i.e., neighbouring) a singularity. In this work we examine singularity avoidance in a motion planning context, finding trajectories which minimize proximity to singular regions, subject to constraints. We define a manipulability-based likelihood associated wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09493","kind":"arxiv","version":3},"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":"1803.09493","created_at":"2026-05-18T00:06:04.692199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.09493v3","created_at":"2026-05-18T00:06:04.692199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09493","created_at":"2026-05-18T00:06:04.692199+00:00"},{"alias_kind":"pith_short_12","alias_value":"RDNHAYKJCTJO","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RDNHAYKJCTJOHTB2","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RDNHAYKJ","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.07521","citing_title":"Stochastic Optimization for Trajectory Planning with Heteroscedastic Gaussian Processes","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RDNHAYKJCTJOHTB2PG76MKBQRB","json":"https://pith.science/pith/RDNHAYKJCTJOHTB2PG76MKBQRB.json","graph_json":"https://pith.science/api/pith-number/RDNHAYKJCTJOHTB2PG76MKBQRB/graph.json","events_json":"https://pith.science/api/pith-number/RDNHAYKJCTJOHTB2PG76MKBQRB/events.json","paper":"https://pith.science/paper/RDNHAYKJ"},"agent_actions":{"view_html":"https://pith.science/pith/RDNHAYKJCTJOHTB2PG76MKBQRB","download_json":"https://pith.science/pith/RDNHAYKJCTJOHTB2PG76MKBQRB.json","view_paper":"https://pith.science/paper/RDNHAYKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.09493&json=true","fetch_graph":"https://pith.science/api/pith-number/RDNHAYKJCTJOHTB2PG76MKBQRB/graph.json","fetch_events":"https://pith.science/api/pith-number/RDNHAYKJCTJOHTB2PG76MKBQRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RDNHAYKJCTJOHTB2PG76MKBQRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RDNHAYKJCTJOHTB2PG76MKBQRB/action/storage_attestation","attest_author":"https://pith.science/pith/RDNHAYKJCTJOHTB2PG76MKBQRB/action/author_attestation","sign_citation":"https://pith.science/pith/RDNHAYKJCTJOHTB2PG76MKBQRB/action/citation_signature","submit_replication":"https://pith.science/pith/RDNHAYKJCTJOHTB2PG76MKBQRB/action/replication_record"}},"created_at":"2026-05-18T00:06:04.692199+00:00","updated_at":"2026-05-18T00:06:04.692199+00:00"}