{"id":"W2294023638","doi":"","title":"Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning","year":2011,"lang":"en","type":"article","venue":"TU/e Research Portal (Eindhoven University of Technology)","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Curvature; Domain (mathematical analysis); Path (computing); Motion planning; Simple (philosophy); Mathematics; Shortest path problem; Motion (physics); Algorithm; Mathematical optimization; Computer science; Geometry; Combinatorics; Mathematical analysis; Artificial intelligence; Robot","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008448118,0.0009410945,0.0009755521,0.0008377826,0.00120973,0.002228936,0.002407261,0.001908519,0.006577783],"category_scores_gemma":[0.006965442,0.0007494353,0.001663028,0.001304211,0.002308572,0.005747284,0.0034666,0.003166721,0.0007242989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001308823,"about_ca_system_score_gemma":0.0009137936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00273889,"about_ca_topic_score_gemma":0.002072675,"domain_scores_codex":[0.9986148,0.0002504706,0.00008235189,0.0003046964,0.0004934323,0.000254193],"domain_scores_gemma":[0.9916245,0.006709148,0.0004647441,0.0006008569,0.0002999437,0.0003008713],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005144887,0.0003750308,0.003037793,0.001383032,0.0001672733,0.001103741,0.0008077021,0.5697609,0.01031102,0.326298,0.0199643,0.06627677],"study_design_scores_gemma":[0.0001242135,0.00009077612,0.001189772,0.00007931608,0.00005168116,0.0004426415,0.0002100032,0.5367455,0.004178809,0.4471645,0.009662842,0.0000598792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1313773,0.001671524,0.817736,0.006186455,0.0001957828,0.0002977998,0.002350317,0.001242449,0.03894247],"genre_scores_gemma":[0.8310204,0.001671688,0.1541999,0.0007999663,0.000241257,0.0003946194,0.002149335,0.0002477868,0.009275123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006577783,"threshold_uncertainty_score":0.0220049,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08347746228870857,"score_gpt":0.313665502521208,"score_spread":0.2301880402324994,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}