{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00150643,0.0001727029,0.0003082667,0.001060996,0.0003894064,0.00002001774,0.001778938,0.0003166561,0.00001476434],"category_scores_gemma":[0.0004104965,0.0001949728,0.0001074594,0.001142443,0.0005911834,0.0004145127,0.0006998715,0.0006548865,0.00002828056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007680649,"about_ca_system_score_gemma":0.0002683882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002079252,"about_ca_topic_score_gemma":0.000009081576,"domain_scores_codex":[0.9977028,0.00008804522,0.0002647489,0.0006558415,0.0006047001,0.0006838911],"domain_scores_gemma":[0.9981411,0.0001477525,0.0002147912,0.0007625867,0.000584121,0.0001496217],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004748118,0.005138921,0.02698314,0.000735899,0.002437493,0.01350014,0.02343329,0.01461011,0.05734619,0.4460713,0.1524027,0.2525927],"study_design_scores_gemma":[0.04018039,0.009378201,0.08416577,0.003091594,0.0002994772,0.001656396,0.01297626,0.5415149,0.1471384,0.1369688,0.01769613,0.004933625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3352729,0.0004176676,0.6097236,0.004625041,0.001072991,0.002561717,0.0003227895,0.002094966,0.04390832],"genre_scores_gemma":[0.7198661,0.000001951337,0.2791443,0.00001049865,0.00002650035,0.000002432769,0.00003055761,0.00001157732,0.000906136],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5269048,"threshold_uncertainty_score":0.795076,"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."}}