{"id":"W2126605958","doi":"10.1109/iros.2004.1389661","title":"Code reusability tools for programming mobile robots","year":2005,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Reusability; Computer science; Code reuse; Mobile robot; Visual programming language; Reuse; Robot; Event-driven programming; Modular design; Reactive programming; Extensible programming; Robotics; Code (set theory); Software engineering; Programming language; Human–computer interaction; Programming paradigm; Inductive programming; Artificial intelligence; Software; Engineering","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.0005750977,0.0001260663,0.0001620296,0.0000384243,0.0001208576,0.000295584,0.0008184228,0.00006272143,0.00001154394],"category_scores_gemma":[0.0002313465,0.000110123,0.00007461586,0.0001956116,0.00003497922,0.0008542062,0.0001642713,0.00008602622,0.0000789093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007221039,"about_ca_system_score_gemma":0.00005872145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008552041,"about_ca_topic_score_gemma":0.000004654555,"domain_scores_codex":[0.9986494,0.00003213752,0.0002532502,0.0004595419,0.000199683,0.0004059589],"domain_scores_gemma":[0.9986607,0.0003593525,0.00006002769,0.0007173358,0.00009260775,0.0001099146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002469567,0.0001027227,0.0001934085,0.00001231556,0.000007832354,0.000001861638,0.000283764,0.02459272,0.00009475082,0.003772079,0.001682098,0.969254],"study_design_scores_gemma":[0.0005333459,0.0002834187,0.001027426,0.0000199277,0.000006988378,0.00002629852,0.00004999071,0.7821891,0.002533706,0.0006868216,0.2122764,0.0003665678],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001600973,0.00005269641,0.9946899,0.001045087,0.0002198498,0.0007335317,0.000002978271,0.0005524652,0.001102492],"genre_scores_gemma":[0.02203305,9.81737e-7,0.9762963,0.0002505679,0.0001464952,0.0002858957,0.000004324885,0.000008554915,0.0009738533],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9688874,"threshold_uncertainty_score":0.4490687,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04637868796296953,"score_gpt":0.3124514177072998,"score_spread":0.2660727297443303,"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."}}