{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001994531,0.001960921,0.0008143131,0.002448546,0.000808025,0.001878352,0.003384755,0.00118509,0.007159432],"category_scores_gemma":[0.008018609,0.00129571,0.002139363,0.001530999,0.001136951,0.003845841,0.002533613,0.003391034,0.003306086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007284915,"about_ca_system_score_gemma":0.001020232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001304812,"about_ca_topic_score_gemma":0.001299205,"domain_scores_codex":[0.9977971,0.0003697037,0.0003195134,0.0003683878,0.0009552076,0.0001900795],"domain_scores_gemma":[0.9959998,0.001965174,0.000488512,0.0008779524,0.0005480804,0.0001205369],"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.0001975117,0.0002816774,0.001594746,0.001476391,0.0001262932,0.0007233333,0.001520716,0.03561488,0.03795863,0.1141578,0.01458753,0.7917606],"study_design_scores_gemma":[0.0004006785,0.0005980167,0.001793062,0.001319671,0.0003266225,0.003004844,0.000397857,0.2835131,0.1222535,0.194397,0.3916819,0.0003136135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002107895,0.0001542631,0.9837821,0.00007828708,0.00002229918,0.00007725726,0.00006501198,0.01212752,0.001585389],"genre_scores_gemma":[0.04107773,0.0005848391,0.9419629,0.0001901982,0.00004584503,0.0004585507,0.001082487,0.00896352,0.005633926],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007159432,"threshold_uncertainty_score":0.0239507,"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."}}