{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KH3QG6LPLYFIBEQIJ43MBV7XN6","short_pith_number":"pith:KH3QG6LP","schema_version":"1.0","canonical_sha256":"51f703796f5e0a8092084f36c0d7f76f9015a6786514917aebaa4c1fe415d0f8","source":{"kind":"arxiv","id":"1904.09780","version":1},"attestation_state":"computed","paper":{"title":"Inducing Multi-Convexity in Path Constrained Trajectory Optimization for Mobile Manipulators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"Andreas Muller, Andrei Ahonen, Arun Kumar Singh, Reza Ghabcheloo","submitted_at":"2019-04-22T09:15:45Z","abstract_excerpt":"In this paper, we propose a novel trajectory optimization algorithm for mobile manipulators under end-effector path, collision avoidance and various kinematic constraints. Our key contribution lies in showing how this highly non-linear and non-convex problem can be solved as a sequence of convex unconstrained quadratic programs (QPs). This is achieved by reformulating the non-linear constraints that arise out of manipulator kinematics and its coupling with the mobile base in a multi-affine form. We then use techniques from Alternating Direction Method of Multipliers (ADMM) to formulate and sol"},"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":"1904.09780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-04-22T09:15:45Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"c55185510afc393927892ae31342bf75da4055e00fcc1b66f53ac21372f3a768","abstract_canon_sha256":"9da8b55d36146ed0b6f08aee8a2c911c195cd128952c9bab3abcdce55294a3b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:03.361964Z","signature_b64":"1VGulmHEREMaJH8q9r1JzRHBmIyZwuvmIatj7J5gw4jXN4FssXJ18R13B8zvM4zUVZ+5md5TnPfZkjfNBUaYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51f703796f5e0a8092084f36c0d7f76f9015a6786514917aebaa4c1fe415d0f8","last_reissued_at":"2026-05-17T23:48:03.361356Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:03.361356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inducing Multi-Convexity in Path Constrained Trajectory Optimization for Mobile Manipulators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"Andreas Muller, Andrei Ahonen, Arun Kumar Singh, Reza Ghabcheloo","submitted_at":"2019-04-22T09:15:45Z","abstract_excerpt":"In this paper, we propose a novel trajectory optimization algorithm for mobile manipulators under end-effector path, collision avoidance and various kinematic constraints. Our key contribution lies in showing how this highly non-linear and non-convex problem can be solved as a sequence of convex unconstrained quadratic programs (QPs). This is achieved by reformulating the non-linear constraints that arise out of manipulator kinematics and its coupling with the mobile base in a multi-affine form. We then use techniques from Alternating Direction Method of Multipliers (ADMM) to formulate and sol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09780","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":"1904.09780","created_at":"2026-05-17T23:48:03.361443+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.09780v1","created_at":"2026-05-17T23:48:03.361443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09780","created_at":"2026-05-17T23:48:03.361443+00:00"},{"alias_kind":"pith_short_12","alias_value":"KH3QG6LPLYFI","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KH3QG6LPLYFIBEQI","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KH3QG6LP","created_at":"2026-05-18T12:33:21.387695+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/KH3QG6LPLYFIBEQIJ43MBV7XN6","json":"https://pith.science/pith/KH3QG6LPLYFIBEQIJ43MBV7XN6.json","graph_json":"https://pith.science/api/pith-number/KH3QG6LPLYFIBEQIJ43MBV7XN6/graph.json","events_json":"https://pith.science/api/pith-number/KH3QG6LPLYFIBEQIJ43MBV7XN6/events.json","paper":"https://pith.science/paper/KH3QG6LP"},"agent_actions":{"view_html":"https://pith.science/pith/KH3QG6LPLYFIBEQIJ43MBV7XN6","download_json":"https://pith.science/pith/KH3QG6LPLYFIBEQIJ43MBV7XN6.json","view_paper":"https://pith.science/paper/KH3QG6LP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.09780&json=true","fetch_graph":"https://pith.science/api/pith-number/KH3QG6LPLYFIBEQIJ43MBV7XN6/graph.json","fetch_events":"https://pith.science/api/pith-number/KH3QG6LPLYFIBEQIJ43MBV7XN6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KH3QG6LPLYFIBEQIJ43MBV7XN6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KH3QG6LPLYFIBEQIJ43MBV7XN6/action/storage_attestation","attest_author":"https://pith.science/pith/KH3QG6LPLYFIBEQIJ43MBV7XN6/action/author_attestation","sign_citation":"https://pith.science/pith/KH3QG6LPLYFIBEQIJ43MBV7XN6/action/citation_signature","submit_replication":"https://pith.science/pith/KH3QG6LPLYFIBEQIJ43MBV7XN6/action/replication_record"}},"created_at":"2026-05-17T23:48:03.361443+00:00","updated_at":"2026-05-17T23:48:03.361443+00:00"}