{"id":"W2162178110","doi":"10.1109/robot.2006.1641770","title":"Heuristic search for coordinating robot agents in adversarial domains","year":2006,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Scalability; Heuristic; Pruning; Set (abstract data type); Robot; Task (project management); Artificial intelligence; Domain (mathematical analysis); Adversarial system; Function (biology); Mathematical optimization; Machine learning; Engineering; Mathematics","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.0005301441,0.0001127174,0.0001540429,0.0001464354,0.0001049594,0.0001051991,0.0005915182,0.00005527875,0.000006786635],"category_scores_gemma":[0.00007212328,0.0001093821,0.00004532935,0.000360714,0.00002507819,0.0002109135,0.0001618316,0.0001099045,0.00003316142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009404979,"about_ca_system_score_gemma":0.00006654609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005771333,"about_ca_topic_score_gemma":0.00001730257,"domain_scores_codex":[0.9986243,0.00005971144,0.0002528336,0.0003626093,0.0002626496,0.0004378746],"domain_scores_gemma":[0.9992582,0.0003049558,0.0000435123,0.0002842623,0.00005497495,0.00005412226],"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.0000376799,0.0005541237,0.04447988,0.00009941511,0.00003340322,0.0003955459,0.001078532,0.7295704,0.001228614,0.1745564,0.01651504,0.03145086],"study_design_scores_gemma":[0.001192313,0.00006333852,0.02412071,0.00002158518,0.000002350926,0.000009710315,0.00001890823,0.9715654,0.0004781323,0.00214539,0.0002169983,0.0001651323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00670755,0.00001179992,0.9862605,0.0003859562,0.0004736702,0.0002832522,0.000002656271,0.0001350255,0.005739619],"genre_scores_gemma":[0.4755661,2.19111e-7,0.5232879,0.00007503886,0.0001365943,0.00001922736,0.000006432125,0.00000787883,0.0009006306],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4688586,"threshold_uncertainty_score":0.4460473,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03714642882213774,"score_gpt":0.3028237112110312,"score_spread":0.2656772823888935,"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."}}