{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004096841,0.000133537,0.0001764333,0.0003249411,0.00008495863,0.00021747,0.001597337,0.00005426021,0.00001114574],"category_scores_gemma":[0.0001126419,0.0001142889,0.0001035021,0.0002964544,0.00006898354,0.0001655955,0.0002392194,0.0001943592,0.00005198346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005087567,"about_ca_system_score_gemma":0.0001178335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005125594,"about_ca_topic_score_gemma":5.894628e-7,"domain_scores_codex":[0.9985082,0.00003181953,0.0005223809,0.0002026347,0.000549394,0.000185533],"domain_scores_gemma":[0.9984325,0.0002775942,0.0003336458,0.0003420307,0.0004635996,0.0001506876],"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.00002984389,0.0002996945,0.00194702,0.00002212403,0.0003114848,0.0003442052,0.0004240191,0.2499809,0.0007490767,0.6732548,0.01034486,0.06229202],"study_design_scores_gemma":[0.001492827,0.0002216533,0.003450389,0.0002623776,0.00005640004,0.0006879754,0.0003051164,0.8934292,0.001572102,0.0701609,0.02785349,0.0005075763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003856463,0.0001019379,0.9902507,0.007960565,0.0005689891,0.0001331737,0.00002794126,0.00007208986,0.0004989638],"genre_scores_gemma":[0.3768716,0.000457832,0.6202711,0.0009434351,0.0008611486,0.00004599305,0.00006122317,0.00003216157,0.000455452],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6434484,"threshold_uncertainty_score":0.4660565,"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."}}