{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:S3YXBIC5GTFTLRJUJZHELUILZ3","short_pith_number":"pith:S3YXBIC5","schema_version":"1.0","canonical_sha256":"96f170a05d34cb35c5344e4e45d10bcee7d7a66d2afb9cd880dbf0182d9d264d","source":{"kind":"arxiv","id":"2403.09160","version":1},"attestation_state":"computed","paper":{"title":"Efficient Lexicographic Optimization for Prioritized Robot Control and Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Abderrahmane Kheddar, Kai Pfeiffer","submitted_at":"2024-03-14T08:16:50Z","abstract_excerpt":"In this work, we present several tools for efficient sequential hierarchical least-squares programming (S-HLSP) for lexicographical optimization tailored to robot control and planning. As its main step, S-HLSP relies on approximations of the original non-linear hierarchical least-squares programming (NL-HLSP) to a hierarchical least-squares programming (HLSP) by the hierarchical Newton's method or the hierarchical Gauss-Newton algorithm. We present a threshold adaptation strategy for appropriate switches between the two. This ensures optimality of infeasible constraints, promotes numerical sta"},"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":"2403.09160","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-03-14T08:16:50Z","cross_cats_sorted":[],"title_canon_sha256":"d1b1085bcb69c6a330c0399c46afe9816130f525c9b276ea602675e7f8317918","abstract_canon_sha256":"d361c1c497c6ff1ac277e8926214d173c1858ef65106e7160216696e4832ec34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:56:06.133589Z","signature_b64":"Tn3xKICF7UyeCDgpmKxNEM/jCtzNZQ0P6G3HMFIViZbWXFF1LIh63haDVBPWXL8FjVBk0wWfWKvFERg0UPxGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96f170a05d34cb35c5344e4e45d10bcee7d7a66d2afb9cd880dbf0182d9d264d","last_reissued_at":"2026-07-05T07:56:06.133248Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:56:06.133248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Lexicographic Optimization for Prioritized Robot Control and Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Abderrahmane Kheddar, Kai Pfeiffer","submitted_at":"2024-03-14T08:16:50Z","abstract_excerpt":"In this work, we present several tools for efficient sequential hierarchical least-squares programming (S-HLSP) for lexicographical optimization tailored to robot control and planning. As its main step, S-HLSP relies on approximations of the original non-linear hierarchical least-squares programming (NL-HLSP) to a hierarchical least-squares programming (HLSP) by the hierarchical Newton's method or the hierarchical Gauss-Newton algorithm. We present a threshold adaptation strategy for appropriate switches between the two. This ensures optimality of infeasible constraints, promotes numerical sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.09160","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.09160/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2403.09160","created_at":"2026-07-05T07:56:06.133303+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.09160v1","created_at":"2026-07-05T07:56:06.133303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.09160","created_at":"2026-07-05T07:56:06.133303+00:00"},{"alias_kind":"pith_short_12","alias_value":"S3YXBIC5GTFT","created_at":"2026-07-05T07:56:06.133303+00:00"},{"alias_kind":"pith_short_16","alias_value":"S3YXBIC5GTFTLRJU","created_at":"2026-07-05T07:56:06.133303+00:00"},{"alias_kind":"pith_short_8","alias_value":"S3YXBIC5","created_at":"2026-07-05T07:56:06.133303+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.21071","citing_title":"Dual Hierarchical Least-Squares Programming with Equality Constraints","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S3YXBIC5GTFTLRJUJZHELUILZ3","json":"https://pith.science/pith/S3YXBIC5GTFTLRJUJZHELUILZ3.json","graph_json":"https://pith.science/api/pith-number/S3YXBIC5GTFTLRJUJZHELUILZ3/graph.json","events_json":"https://pith.science/api/pith-number/S3YXBIC5GTFTLRJUJZHELUILZ3/events.json","paper":"https://pith.science/paper/S3YXBIC5"},"agent_actions":{"view_html":"https://pith.science/pith/S3YXBIC5GTFTLRJUJZHELUILZ3","download_json":"https://pith.science/pith/S3YXBIC5GTFTLRJUJZHELUILZ3.json","view_paper":"https://pith.science/paper/S3YXBIC5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.09160&json=true","fetch_graph":"https://pith.science/api/pith-number/S3YXBIC5GTFTLRJUJZHELUILZ3/graph.json","fetch_events":"https://pith.science/api/pith-number/S3YXBIC5GTFTLRJUJZHELUILZ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S3YXBIC5GTFTLRJUJZHELUILZ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S3YXBIC5GTFTLRJUJZHELUILZ3/action/storage_attestation","attest_author":"https://pith.science/pith/S3YXBIC5GTFTLRJUJZHELUILZ3/action/author_attestation","sign_citation":"https://pith.science/pith/S3YXBIC5GTFTLRJUJZHELUILZ3/action/citation_signature","submit_replication":"https://pith.science/pith/S3YXBIC5GTFTLRJUJZHELUILZ3/action/replication_record"}},"created_at":"2026-07-05T07:56:06.133303+00:00","updated_at":"2026-07-05T07:56:06.133303+00:00"}