{"id":"W4388709207","doi":"10.23977/jaip.2023.060705","title":"Research on Robot Path Planning Based on Simulated Annealing Algorithm","year":2023,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Practice","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Shortest path problem; Motion planning; Simulated annealing; Constrained Shortest Path First; Crossover; Computer science; K shortest path routing; Mathematical optimization; Correctness; Shortest Path Faster Algorithm; Any-angle path planning; Yen's algorithm; MATLAB; Path (computing); Algorithm; Robot; Mathematics; Dijkstra's algorithm; Artificial intelligence; Theoretical computer science; Graph","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005891538,0.000705794,0.000927701,0.0007827693,0.0005811365,0.0008863651,0.0009499816,0.0008078345,0.001904071],"category_scores_gemma":[0.00129827,0.0005448361,0.0009668418,0.001289965,0.0006577799,0.001536336,0.000593407,0.0009537544,0.000312558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008453308,"about_ca_system_score_gemma":0.001776283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005734636,"about_ca_topic_score_gemma":0.002384559,"domain_scores_codex":[0.9993176,0.0001672809,0.00004052219,0.0001841316,0.000237453,0.00005302989],"domain_scores_gemma":[0.9996263,0.0001755973,0.0000390428,0.00003638696,0.0001052379,0.00001746475],"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.00007122775,0.00004518185,0.001231716,0.0005633125,0.0001020157,0.0001773385,0.0002450434,0.7596906,0.01340441,0.0583531,0.002049252,0.1640668],"study_design_scores_gemma":[0.0000192586,0.00007498261,0.0003900724,0.00002817719,0.00003135725,0.0001156594,0.00003653769,0.978962,0.003386765,0.01047302,0.006458004,0.000024113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006967768,0.001456387,0.9862579,0.000173155,0.00006263167,0.00004171254,0.00002320583,0.0003334275,0.004683844],"genre_scores_gemma":[0.4287197,0.006783513,0.55615,0.0001434119,0.0001033503,0.0003633643,0.0001893689,0.000153379,0.007394031],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005734636,"threshold_uncertainty_score":0.01140249,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2319650491379905,"score_gpt":0.4655164877539756,"score_spread":0.2335514386159852,"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."}}