{"id":"W4387640867","doi":"10.1007/s41315-023-00300-3","title":"Constraint-free discretized manifold-based path planner","year":2023,"lang":"en","type":"article","venue":"International Journal of Intelligent Robotics and Applications","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Motion planning; Any-angle path planning; Path (computing); Constraint (computer-aided design); Mathematical optimization; Discretization; Representation (politics); Homotopy; Local consistency; Fast path; Mathematics; Computer science; Robot; Topology (electrical circuits); Artificial intelligence; Constraint satisfaction problem; Probabilistic logic","routes":{"ca_aff":true,"ca_fund":true,"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.000221669,0.0005085946,0.0009400993,0.0004597124,0.0004475112,0.0006689958,0.001453811,0.00097916,0.005825265],"category_scores_gemma":[0.001264055,0.0004339058,0.0004396784,0.000725762,0.0007778399,0.0009411362,0.001431866,0.0009695542,0.0007318475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007816264,"about_ca_system_score_gemma":0.001391032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008549361,"about_ca_topic_score_gemma":0.01038463,"domain_scores_codex":[0.9997169,0.00004895397,0.00001115821,0.00005861225,0.0001321823,0.00003206046],"domain_scores_gemma":[0.9996201,0.0001673238,0.00002961749,0.00005353081,0.0001009143,0.0000283844],"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.00007838245,0.00002525435,0.0001583481,0.00005543738,0.00001316841,0.000066127,0.00004521135,0.9468699,0.0020684,0.01202236,0.00154782,0.03704961],"study_design_scores_gemma":[0.000007276843,0.00001154571,0.0000223464,0.000002692876,0.000001458923,0.000007916819,0.000005203874,0.9960644,0.0002725825,0.003143085,0.0004586796,0.000002859256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0128226,0.00008464996,0.9812286,0.00009987243,0.00002719093,0.0000502816,0.0001638162,0.0008132106,0.004709746],"genre_scores_gemma":[0.6092364,0.0001149033,0.3857621,0.00008472698,0.00001550432,0.000223255,0.0004987696,0.0001808617,0.00388364],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008549361,"threshold_uncertainty_score":0.01948738,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02240096966686959,"score_gpt":0.284589378431241,"score_spread":0.2621884087643714,"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."}}