{"id":"W3111515510","doi":"10.1109/smc42975.2020.9282945","title":"Constraint-Free Discretized Manifolds for Robotic Path Planning","year":2020,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Motion planning; Constraint (computer-aided design); Any-angle path planning; Path (computing); Mathematical optimization; Manifold (fluid mechanics); Discretization; Gravitational singularity; Obstacle; Computation; Computer science; Configuration space; Obstacle avoidance; Topology (electrical circuits); Mathematics; Robot; Algorithm; Artificial intelligence; Mobile robot; Geometry; Engineering; Mathematical analysis; Combinatorics","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.0002247436,0.0002025507,0.0002898619,0.00004735863,0.000132548,0.0001992954,0.001645346,0.0000757852,0.00002102109],"category_scores_gemma":[0.0003544858,0.0001767804,0.0001062492,0.0002484583,0.00005265622,0.0002953535,0.0004036713,0.0001375338,0.00005986315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002255705,"about_ca_system_score_gemma":0.00008391209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000540707,"about_ca_topic_score_gemma":1.186805e-7,"domain_scores_codex":[0.9983694,0.00004294332,0.0002986774,0.0005513513,0.0002791644,0.0004584581],"domain_scores_gemma":[0.9986728,0.0002765101,0.00009356415,0.0006236827,0.00005804991,0.0002753485],"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.0000984227,0.0001684087,0.003446789,0.000301289,0.0002633442,0.0008296256,0.00952874,0.1303031,0.003655307,0.6564646,0.1751773,0.0197631],"study_design_scores_gemma":[0.001258799,0.0002258136,0.0005833944,0.00004070963,0.00001344454,0.00003744161,0.0001449058,0.991885,0.0003039975,0.004460442,0.0007371909,0.0003088485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002029365,0.00006466028,0.9842442,0.009328227,0.0003540128,0.0003491036,0.000006361325,0.0006392081,0.0048113],"genre_scores_gemma":[0.1366066,9.770504e-7,0.8604935,0.002397197,0.0001776785,0.00003115081,0.00000999621,0.00001838486,0.0002643924],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8615819,"threshold_uncertainty_score":0.7208897,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04602288099158324,"score_gpt":0.2698890060469103,"score_spread":0.223866125055327,"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."}}