{"id":"W2069731879","doi":"10.1177/027836402320556377","title":"On Path Planning and Obstacle Avoidance for Nonholonomic Platforms with Manipulators: A Polynomial Approach","year":2002,"lang":"en","type":"article","venue":"The International Journal of Robotics Research","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Nonholonomic system; Motion planning; Obstacle; Obstacle avoidance; Cartesian coordinate system; Constraint (computer-aided design); Configuration space; Control theory (sociology); Polynomial; Path (computing); Computer science; Orientation (vector space); Space (punctuation); Mobile robot; Mathematics; Mathematical optimization; Robot; Control (management); Artificial intelligence; Geometry; Mathematical analysis; Physics","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.001638303,0.000121432,0.0001743279,0.0003014025,0.0002124531,0.0003667843,0.001841482,0.00005002446,0.00000209964],"category_scores_gemma":[0.0002335578,0.00007476814,0.00005301802,0.000169332,0.0001327685,0.0003586783,0.0002247404,0.0006012542,0.000007573146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001672547,"about_ca_system_score_gemma":0.00008009993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006312725,"about_ca_topic_score_gemma":2.286929e-7,"domain_scores_codex":[0.9979656,0.00005442636,0.0003109358,0.0002148041,0.001120156,0.0003340962],"domain_scores_gemma":[0.9979935,0.0009359904,0.0002177114,0.0002634363,0.0004754722,0.0001138782],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005482222,0.0004063831,0.001753418,0.00002431192,0.0003363552,0.0003137604,0.004747944,0.9397082,0.0002772782,0.03129814,0.01044328,0.01014272],"study_design_scores_gemma":[0.001476564,0.0007883682,0.001309898,0.0001678215,0.000006640383,0.001054937,0.0001932727,0.9916943,0.000188139,0.002792158,0.000197403,0.0001305373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1244309,0.0003864789,0.8707898,0.002962474,0.000535584,0.000265758,0.00000501887,0.00001999325,0.0006038962],"genre_scores_gemma":[0.8068344,0.00001888119,0.1924023,0.0001257115,0.000360291,0.000007033781,0.000001014476,0.00001562838,0.0002346823],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6824035,"threshold_uncertainty_score":0.353691,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1329448556421738,"score_gpt":0.3472689054151658,"score_spread":0.214324049772992,"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."}}