{"id":"W2047599849","doi":"10.1016/j.cor.2014.06.016","title":"An innovative multi-agent search-and-rescue path planning approach","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Mathematical optimization; Motion planning; Time horizon; Constraint (computer-aided design); Path (computing); Integer programming; Variety (cybernetics); Representation (politics); Relaxation (psychology); Computational complexity theory; Computation; Bellman equation; Algorithm; Mathematics; Artificial intelligence; Robot","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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003456508,0.0002184579,0.0002554361,0.0006406276,0.001118055,0.001212139,0.00170535,0.0001068464,0.000002471624],"category_scores_gemma":[0.0002099775,0.000201061,0.0000305521,0.001685893,0.0002855286,0.0008806671,0.0009010466,0.0008234517,0.00006322655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001139548,"about_ca_system_score_gemma":0.0002536572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002910396,"about_ca_topic_score_gemma":0.00000386254,"domain_scores_codex":[0.9957312,0.001309563,0.0003414403,0.0009290403,0.000913699,0.0007750418],"domain_scores_gemma":[0.9974376,0.0002623281,0.00001373649,0.001086883,0.0008475285,0.0003519289],"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.000005088692,0.0003221993,0.0007128255,0.00002606307,0.000033509,0.00003138958,0.01405459,0.9101384,0.001399898,0.02733734,0.0005786743,0.04536001],"study_design_scores_gemma":[0.0004804314,0.0002912743,0.007723697,0.00004687526,0.000001320029,0.00003344935,0.0002649183,0.9903188,0.0002611146,0.00003738884,0.0003105785,0.0002301991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05187021,0.00007425569,0.9463763,0.0004843098,0.0002181782,0.0004580231,0.000003799685,0.000213398,0.0003015721],"genre_scores_gemma":[0.4234217,0.000003587061,0.5761057,0.0001394025,0.0001260784,0.00004957953,0.00002884754,0.0000150567,0.0001100709],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3715515,"threshold_uncertainty_score":0.9998247,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1443338905431879,"score_gpt":0.4048317940207116,"score_spread":0.2604979034775238,"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."}}