[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"\"}":3,"_public_publisher_byId_fc949bdc-33b8-4a3e-87c0-91f892e0f3d1":656,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"totalCitation\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:fc949bdc-33b8-4a3e-87c0-91f892e0f3d1,\"}":790},{"meta":4,"data":6},{"total":5},"117",[7,60,176,207,299,413,445,480,543,572],{"id":8,"createTime":9,"updateTime":10,"relativeEntities":11,"slug":12,"properties":13,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":29,"subjectFields":30,"manageAffiliations":31,"indexDatabases":32,"url":33,"thumbnailPath":34,"statistic":35,"gsStatistic":26,"type":26,"analyzePriority":26},"5a09599f-54d1-44c3-8f16-3847ac552024","2023-08-17T04:28:50.832+00:00","2025-10-13T23:58:52.517+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Truy%E1%BB%81n-nhi%E1%BB%85m-Vi%E1%BB%87t-Nam",{"country":14,"issn":16,"introduce":18,"title":21},{"VOID":15},"VN",{"VOID":17},"08667829",{"EN":19,"VI":20},"{\"ops\":[{\"insert\":\"Vietnam Journal of Infectious Diseases is a social - professional forum of the Vietnam Society for Infectious Diseases, whose responsibility is to introduce the researches, the scientific advances in Vietnam and from the world; to contribute to the improvement of knowledges for health care staffs about clinic, treatment, guideline, prevention, epidemiology for infectious diseases, HIV\u002FAIDS and community health care; to provide, exchange and publish scientific information to the public accurately and promptly.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Vietnam Journal of Infectious Diseases publishes in the whole country; serves the professional work for researchers, clinical staffs, administrators, undergraduate and postgraduate students who are working and studying in the infections, tropical diseases and HIV\u002FAIDS from central to local levels, also organizations and individuals in the world who are interested in infectious and tropical diseases and prevention for HIV\u002FAIDS.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Editor in Chief:\"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"insert\":\"Prof. Dr. Nguyen Van Kinh. - Chairman of Editorial Board\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"Prof. Dr. Nguyen Van Mui.\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Headquarter:\"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Address:\"},{\"insert\":\" Level 6, National Hospital for Tropical Diseases, No. 78 Giai Phong Street, Dong Da District, Hanoi city, Vietnam.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tel:\"},{\"insert\":\" \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:02435765464\"},\"insert\":\"02435765464\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913552672\"},\"insert\":\"0913552672\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913228072\"},\"insert\":\"0913228072\"},{\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Email\"},{\"insert\":\": \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Findex\u002Fadmin\u002Fcontexts\u002Fmailto:tungphamvan52@gmail.com\"},\"insert\":\"tungphamvan52@gmail.com\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Fmailto:tapchitruyennhiem@gmail.com\"},\"insert\":\"tapchitruyennhiem@gmail.com\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Bank account:\"},{\"insert\":\" 0021000275119, Vietcombank Hanoi Branch. Transaction office No. 7, 402 Tran Khat Chan, Hai Ba Trung District, Hanoi city, Vietnam.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Tạp chí Truyền nhiễm Việt Nam là cơ quan ngôn luận của Hội Truyền nhiễm Việt Nam, chịu sự lãnh đạo, chỉ đạo trực tiếp của Thường vụ Ban Chấp hành Hội Truyền nhiễm Việt Nam; sự kiểm tra, giám sát về nghiệp vụ báo chí của các cơ quan chức năng quản lý báo chí thuộc Bộ Thông tin và Truyền thông và Ban Tuyên giáo Trung ương Đảng.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí có trách nhiệm giới thiệu các công trình nghiên cứu khoa học, những tiến bộ khoa học trên thế giới và trong nước, góp phần nâng cao kiến thức khoa học cho cán bộ y tế về lâm sàng, điều trị, hướng dẫn, dự phòng, dịch tễ học các bệnh truyền nhiễm, HIV\u002FAIDS và chăm sóc sức khỏe cộng đồng; cung cấp, trao đổi, phổ biến các thông tin khoa học tới công chúng chính xác và kịp thời.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí xuất bản 03 tháng\u002F01 kỳ và được phát hành qua Bưu điện và tự phát hành trong phạm vi toàn quốc.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Lãnh đạo Tạp chí: \"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"insert\":\"Tổng Biên tập: ThS.BSCKII Nguyễn Trung Cấp\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"Phó Tổng Biên tập:\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"            TS.BSCKII Phạm Ngọc Thạch\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Trụ sở tòa soạn:\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Địa chỉ: Tầng 6, Bệnh viện Bệnh Nhiệt đới Trung ương, 78 đường Giải Phóng, phường Phương Mai, quận Đống Đa, thành phố Hà Nội.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Điện thoại:\"},{\"insert\":\" \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:02435765464\"},\"insert\":\"02435765464\"},{\"insert\":\" - \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913228072\"},\"insert\":\"0913228072\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Email\"},{\"insert\":\": \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Findex\u002Fadmin\u002Fcontexts\u002Fmailto:tungphamvan52@gmail.com\"},\"insert\":\"tungphamvan52@gmail.com\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Fmailto:tapchitruyennhiem@gmail.com\"},\"insert\":\"tapchitruyennhiem@gmail.com\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tài khoản:\"},{\"insert\":\" Số 0021000275119 Ngân hàng Ngoại thương Việt Nam, chi nhánh Hà Nội (Vietcombank Hà Nội). Phòng giao dịch số 7, 402 Trần Khát Chân, quận Hai Bà Trưng, Thành phố Hà Nội.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"EN":22,"VI":23},"Vietnam Journal of Infectious Diseases","Tạp chí Truyền nhiễm Việt Nam","PUBLISHER","VERIFIED",null,"Admin update database","PENDING",51,[],[],[],"https:\u002F\u002Ftruyennhiemvietnam.vn\u002Findex.php\u002Fvjid","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F5a09599f-54d1-44c3-8f16-3847ac552024\u002Fadb0e52bf25e0de580fd4289519cb8bf.jpg",{"impactFactor":36,"impactFactorByYear":37,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":41,"totalPublicationByYear":42,"totalCitation":48,"totalCitationByYear":49,"totalCitationPerPublication":54,"totalCitationPerPublicationByYear":55,"hindexLast5Year":59,"hindex":59},0,{"2022":38,"2023":39,"2024":40},0.01,0.03,0.13,315,{"2020":43,"2021":44,"2022":45,"2023":46,"2024":47},63,58,57,65,72,43,{"2020":50,"2021":51,"2022":52,"2023":53},8,15,9,11,0.14,{"2020":40,"2021":56,"2022":57,"2023":58},0.26,0.16,0.17,3,{"id":61,"createTime":62,"updateTime":63,"relativeEntities":64,"slug":65,"properties":66,"entityType":24,"verifyStatus":25,"verifyTime":78,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":79,"subjectFields":80,"manageAffiliations":81,"indexDatabases":136,"url":137,"thumbnailPath":26,"statistic":138,"gsStatistic":155,"type":175,"analyzePriority":26},"25b6bd10-676c-40c0-8dc3-356d1679a284","2023-05-19T02:22:33.430+00:00","2026-06-18T23:33:57.141+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Y-D%C6%B0%E1%BB%A3c-h%E1%BB%8Dc-C%E1%BA%A7n-Th%C6%A1",{"country":67,"issn":68,"introduce":70,"title":73,"gsId":76},{"VOID":15},{"VOID":69},"23541210",{"EN":71,"VI":72},"\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">04\u002F10\u002F2015 Ministry of Information and Communications allowed Can Tho journal of medicine and pharmacy to operate (102 \u002FGP-BTTTT)\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">07\u002F16\u002F2015 Can Tho journal of medicine and pharmacy is internationally recognized: ISSN 2354-1210\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">In 2016, The journal has been included in the list of medical science journals by The State Council for professorship which is awarded a work score of 0-0.5 points for a published article.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Can Tho Journal of Medicine and Pharmacy welcome original works that haven’t been submitted or published in other medical journals. Posts must contain content related to one of the journal’s categories.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The content published\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The journal is divided into 3 categories:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Scientific research article: are valuable scientific works, which have been researched and accepted.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Overview of medicine, biology and pharmacy: serving the objective of continuing training in the fields of medicine, biology and pharmacy; to systematize classical and modern knowledge.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Update information on new knowledge about medicine, biology, pharmacy in the country and in the world.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Scope\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Publication and introduction of scientific research in the fields:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Medicine (internal medicine, surgery, pediatrics, obstetrics and gynecology, odonto-stomatology, laboratory, oncology, traditional medicine, nursing).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Biology (genetics, biotechnology).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Pharmacology (pharmaceutics, drug quality analysis-control, synthetic pharmaceutical chemistry, biochemistry, pharmacognosy, botany, clinical pharmacy).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- To enhance the quality of undergraduate, postgraduate education, scientifically researching and meet the necessary treatment in hospital.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Introducing the updated domestic and oversea information about science technology to promote scientific research and exchanging technology in local, other universities.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Exchanging pharmaceutical and medical information for social health developing in the Mekong Delta and Vietnam.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The object\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Postgraduate students, student of Can Tho University of Medicine and Pharmacy, scientists from schools, research institutes, hospitals, health centers, pharmaceutical companies of the Mekong Delta; other provinces and regions in Vietnam and other country.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Address\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Headquarters of Can Tho Journal of Medicine and Pharmacy, located Scientific Research and International Cooperation Office: 179 Nguyen Van Cu Street, An Khanh Ward, Ninh Kieu District, Can Tho City, Vietnam.\u003C\u002Fspan>\u003C\u002Fp>","\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Ngày 16\u002F7\u002F2015, Tạp chí Y Dược học Cần Thơ được cấp chỉ số quốc tế: ISSN 2354-1210.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 4\u002F2016, Tạp chí đã được Hội đồng Giáo sư ngành Y đưa vào danh sách các tạp chí khoa học Y học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Năm 2020 Tạp chí Y Dược học Cần Thơ đã được phê duyệt vào danh mục của các Hội đồng Giáo sư ngành Dược học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ ra 12 số\u002Fnăm, 180-200 trang\u002Fsố.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 12\u002F2022 Tạp chí Y Dược học Cần Thơ là thành viên của hệ thống Crossref và từ tháng 01\u002F2023 tạp chí thực hiện bình duyệt online kín 2 chiều nhằm tăng tính minh bạch, tin cậy của các công trình nghiên cứu khoa học và đảm bảo tốt nhất chất lượng khoa học của bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ, mục đích và phạm vi của tạp chí\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ và mục đích hoạt động của tạp chí: xuất bản nhằm mục đích phổ biến kết quả từ các đề tài nghiên cứu khoa học; giao lưu trao đổi khoa học, chia sẻ kinh nghiệm, học tập, đồng thời cập nhật thông tin khoa học mới trong các lĩnh vực y, sinh, dược học trong và ngoài nước.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phạm vi của tạp chí: Tạp chí xuất bản được chia thành 3 chuyên mục: (i) Bài báo nghiên cứu khoa học là kết quả công trình nghiên cứu khoa học có giá trị đã được triển khai nghiên cứu, (ii) Bài tổng quan y, sinh, dược học: phục vụ mục tiêu đào tạo liên tục trong lĩnh vực y, sinh, dược học; nhằm hệ thống hóa những kiến thức kinh điển và hiện đại; (iii) Thông tin cập nhật kiến thức mới về y, sinh, dược học trong nước và trên thế giới.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Chính sách truy cập mở\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ áp dụng chính sách truy cập mở đối với các bài báo đã xuất bản đến với độc giả, nhằm mở rộng cơ hội tiếp cận các kết quả nghiên cứu chất lượng cao và tăng cường trao đổi kiến thức. Tạp chí đăng tải trực tuyến (miễn phí) toàn văn các bài báo được công bố trên website của Tạp chí (https:\u002F\u002Ftapchi.ctump.edu.vn).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đạo đức xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ cam kết tuân thủ đạo đức xuất bản phù hợp với các hướng dẫn và tiêu chuẩn của the Committee on Publication Ethics (COPE), tuân thủ các nguyên tắc của COPE’s Core Practices, Best Practices Guidelines for Journal Editors và Guidelines on Good Publication Practices.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Bản thảo bài báo chỉ được chấp nhận khi được tác giả chịu trách nhiệm chính cam kết các nội dung sau: Các nội dung của bản thảo chưa được đăng tải toàn bộ hoặc một phần ở các tạp chí khác; Tất cả các tác giả đều có đóng góp một cách đáng kể vào quá trình nghiên cứu hoặc chuẩn bị bản thảo và cùng chịu trách nhiệm về các nội dung của bản thảo; Tuân thủ các biện pháp đảm bảo đạo đức nghiên cứu (ví dụ thỏa thuận đồng ý tham gia nghiên cứu).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Cam kết bảo mật\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí cam kết thực hiện và tuân thủ các quy định của luật và các văn bản hướng dẫn liên quan đến bảo mật thông tin cá nhân trên không gian mạng. Các thông tin mà người dùng (tác giả, độc giả, biên tập viên, người phản biện) nhập vào các biểu mẫu trên Hệ thống Quản lý xuất bản trực tuyến của tạp chí chỉ được sử dụng vào các mục đích đã được tuyên bố rõ ràng và sẽ không được cung cấp cho bất kỳ bên thứ ba nào khác, hay dùng vào bất kỳ mục đích nào khác.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phí gửi bài\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng bài: 1.000.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng nhanh: 1.500.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với tác giả là cán bộ viên chức thuộc Trường Đại học Y Dược Cần Thơ thì được hỗ trợ 50% lệ phí gửi đăng bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với sinh viên thực hiện đề tài nghiên cứu khoa học cấp trường được hỗ trợ 100% lệ phí đăng bài ( Tác giả gửi đính kèm “ Quyết định về việc giao tổ chức thực hiện đề tài nghiên cứu khoa học cấp Trường của sinh viên”).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Hình thức nộp lệ phí:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Tiền mặt:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Nộp trực tiếp tại Phòng Tài chính - Kế toán, Trường Đại học Y Dược Cần Thơ, số 179 Nguyễn Văn Cừ, P. An Khánh, Q. Ninh Kiều, thành phố Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Chuyển khoản:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tên Tài khoản: Trường ĐHYD Cần Thơ, Số TK: 0111000115668, tại ngân hàng Vietcombank chi nhánh Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Thời gian: Áp dụng từ ngày 01\u002F02\u002F2023.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">* Phí gửi bài không được hoàn trả khi bài viết bị từ chối hoặc tác giả xin rút bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Quy trình phản biện bài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ thực hiện quy trình phản biện kín hai chiều nghiêm ngặt. Danh tính của những người phản biện không được tiết lộ cho các tác giả và ngược lại. Quy trình thẩm định bài báo đăng gồm các bước sau:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tiếp nhận bản thảo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tác giả liên hệ gửi bản thảo đến Tạp chí qua hệ thống trực tuyến tại website: https:\u002F\u002Ftapchi.ctump.edu.vn. Hướng dẫn về cách đăng ký, gửi bài và chuẩn bị bản thảo được cung cấp trên website của Tạp chí.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sàng lọc sơ bộ\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sau khi Tòa soạn nhận được bài báo của tác giả, Ban Thư ký sẽ tiến hành kiểm tra sơ bộ bài báo (các yêu cầu về nội dung và hình thức). Những bài báo không đúng quy cách hoặc có nội dung không phù hợp hoặc vi phạm bản quyền sẽ bị từ chối (Ban Thư ký thông báo phản hồi đến tác giả trong vòng 1 tuần). Những bài báo đủ điều kiện, được Ban Thư ký tòa soạn chuyển đến Ban Biên tập có cùng chuyên môn với nội dung bài báo để đề xuất người phản biện. Thời gian kể từ khi Ban Biên tập nhận bài báo đến khi đề xuất người phản biện bài báo chậm nhất là 5 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Vòng phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký gửi bài và yêu cầu phản biện đến 02 phản biện độc lập.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Các phản biện gởi nhận xét cho Ban Thư ký. Thời gian từ khi gửi bài cho phản biện đến khi nhận ý kiến của phản biện tối đa là 20 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xử ký kết quả phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Nếu ý kiến đồng ý cho đăng và không cần chỉnh sửa, Ban Thư ký tiếp tục đăng bài theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Nếu ý kiến đồng ý đăng và cần chỉnh sửa, Ban Thư ký sẽ thông tin đến tác giả chỉnh sửa theo yêu cầu của người phản biện. Thời gian chỉnh sửa và gửi lại kéo dài không quá 2 tuần, từ khi tác giả bài báo nhận được thông tin (Quá trình này có thể lặp lại tối đa 2 lần\u002F1 bài báo). Khi có sự thống nhất, đồng ý của người phản biện; bài báo được tiếp tục đăng theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Những bài báo có chất lượng không đạt yêu cầu, cả 2 phản biện không đồng ý cho đăng sẽ bị Tòa soạn từ chối đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký tổng hợp các bản thảo đã được tác giả hoàn thiện sau thẩm định trình Ban Biên tập xem xét, Tổng Biên tập phê duyệt, quyết định bài đăng theo các tiêu chí: sự phù hợp nội dung với tôn chỉ và mục đích, thể loại bài viết (ưu tiên các bài có bài có nghiên cứu chuyên sâu, hàm lượng khoa học cao), đóng góp mới bài báo, bài báo được ưu tiên đăng trong số gần nhất của Tạp chí theo thứ tự: tính thời sự, chất lượng bài báo và thời gian gửi bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Ban Biên tập và Ban Thư ký biên tập bản thảo, chế bản, đọc rà soát lỗi. Thời gian hoàn thành từ 10-15 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Ban Thư ký có trách nhiệm thông báo cho tác giả bài báo (bằng e-mail) về tình hình phê duyệt bài báo, thời gian, số kỳ, tập xuất bản bài báo theo qui định.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">4. Danh sách bài báo theo số Tạp chí được in ấn và phát hành trong năm định kỳ được công bố chính thức trên website: https:\u002F\u002Ftapchi.ctump.edu.vn\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>",{"EN":74,"VI":75},"Cantho Journal of Medicine and Pharmacy","Tạp chí Y Dược học Cần Thơ",{"VOID":77},"wcQ1uqwAAAAJ","2023-05-30T08:17:21.868+00:00",32,[],[82],{"id":83,"createTime":84,"updateTime":85,"relativeEntities":86,"slug":87,"properties":88,"entityType":98,"verifyStatus":25,"verifyTime":99,"verifyNote":26,"syncStatus":28,"languages":100,"translateLanguages":26,"viewCount":103,"url":104,"parentIds":105,"statistic":106},"6413896b-eca9-442b-a73f-182a58a0ce40","2023-06-12T14:59:13.446+00:00","2026-06-19T02:29:32.871+00:00",[],"Tr%C6%B0%E1%BB%9Dng-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Y-D%C6%B0%E1%BB%A3c-C%E1%BA%A7n-Th%C6%A1",{"country":89,"title":90,"address":93,"abbreviation":96},{"VOID":15},{"EN":91,"VI":92},"Can Tho University of Medicine and Pharmacy","Trường Đại học Y Dược Cần Thơ",{"VI":94,"EN":95},"Số 179, đường Nguyễn Văn Cừ, phường An Khánh, quận Ninh Kiều, thành phố Cần Thơ, Việt Nam","No 179, Nguyen Van Cu street, An Khanh ward, Ninh Kieu district, Can Tho city, Vietnam",{"VOID":97},"ctump","AFFILIATION","2023-08-01T14:07:27.977+00:00",[101,102],"VI","EN",12,"http:\u002F\u002Fwww.ctump.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":107,"i10Index":111,"i10IndexLast5Year":59,"totalPublication":112,"totalPublicationByYear":113,"totalCitation":122,"totalCitationByYear":123,"totalCitationPerPublication":128,"totalCitationPerPublicationByYear":129,"hindexLast5Year":135,"hindex":135},{"2022":108,"2023":109,"2024":110,"2025":38},0.1,0.05,0.07,4,1489,{"2013":114,"2014":115,"2015":115,"2016":111,"2017":115,"2018":59,"2019":114,"2020":116,"2021":117,"2022":118,"2023":119,"2024":120,"2025":121,"2026":111},2,1,10,84,281,680,260,156,313,{"2013":59,"2014":114,"2018":124,"2021":125,"2022":126,"2023":127},17,36,123,132,0.21,{"2013":130,"2014":114,"2018":131,"2021":132,"2022":133,"2023":134},1.5,5.67,0.43,0.44,0.19,6,[],"https:\u002F\u002Ftapchi.ctump.edu.vn\u002Findex.php\u002Fctump",{"impactFactor":36,"impactFactorByYear":139,"i10Index":114,"i10IndexLast5Year":114,"totalPublication":140,"totalPublicationByYear":141,"totalCitation":147,"totalCitationByYear":148,"totalCitationPerPublication":151,"totalCitationPerPublicationByYear":152,"hindexLast5Year":135,"hindex":135},{"2022":38,"2023":36,"2024":39,"2025":38},1956,{"0":114,"2019":114,"2020":50,"2021":142,"2022":143,"2023":144,"2024":145,"2025":146},76,403,789,305,371,524,{"0":114,"2019":135,"2021":124,"2022":149,"2023":150,"2024":111,"2025":114},287,206,0.27,{"0":115,"2019":59,"2021":153,"2022":154,"2023":56,"2024":38,"2025":38},0.22,0.71,{"impactFactor":26,"impactFactorByYear":26,"i10Index":114,"i10IndexLast5Year":114,"totalPublication":156,"totalPublicationByYear":157,"totalCitation":163,"totalCitationByYear":164,"totalCitationPerPublication":169,"totalCitationPerPublicationByYear":170,"hindexLast5Year":135,"hindex":135},461,{"0":158,"2019":114,"2021":159,"2022":160,"2023":161,"2024":158,"2025":162},7,37,296,107,5,419,{"2021":59,"2022":59,"2023":165,"2024":166,"2025":167,"2026":168},71,126,171,41,0.91,{"2021":171,"2022":38,"2023":172,"2024":173,"2025":174},0.08,0.66,18,34.2,"JOURNAL",{"id":177,"createTime":178,"updateTime":179,"relativeEntities":180,"slug":181,"properties":182,"entityType":24,"verifyStatus":25,"verifyTime":193,"verifyNote":26,"syncStatus":28,"languages":194,"translateLanguages":26,"viewCount":36,"subjectFields":195,"manageAffiliations":196,"indexDatabases":197,"url":198,"thumbnailPath":26,"statistic":26,"gsStatistic":199,"type":175,"analyzePriority":26},"f8d0bf97-8d89-482e-b58c-2fc481a0b79b","2025-10-27T06:27:08.591+00:00","2026-06-18T23:33:41.667+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-v%C3%A0-C%C3%B4ng-ngh%E1%BB%87-nhi%E1%BB%87t-%C4%91%E1%BB%9Bi",{"country":183,"introduce":184,"gsId":186,"title":188,"issn":191},{"VOID":15},{"EN":185},"\u003Cp style=\"text-align:justify;\">     Journal of Tropical Science and Engineering (JTSE) is a multidisciplinary scientific journal, licensed to operate as a print journal in 2012 and an electronic journal in 2024 (License No.1479\u002FGP-BTTTT dated August 20, 2012 and No.91\u002FGP-BTTTT dated April 9, 2024 issued by the Ministry of Information and Communications of Vietnam). The JTSE is headquartered in Hanoi.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">        The JTSE is published every 3 months (4 issues\u002Fyear), publishing research results and overview articles in 3 groups of fields: Tropical Ecology and Environment; Chemistry and Material Sciences; Biomedicine and Pharmacy. In 2022, the JTSE registered the international identifier Digital Object Identifier (DOI): 10.58334\u002Fvrtc.jtst and assigned DOI codes to all articles of the journal. The members of the Editorial Board of the JTSE are prestigious scientists and leading scientists from Vietnam and many countries in the world. The JTSE has been recognized by the Vietnam State Council for Professorship to score scientific articles in Chemistry, Medicine and Biology with scores ranging from 0-0.75 points.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">      Currently, the JTSE is building and perfecting a set of criteria and making efforts to join the List of prestigious  international journals with a roadmap to enter Scopus and SCIE in the coming time.\u003C\u002Fp>",{"VOID":187},"MS2_GJQAAAAJ",{"VI":189,"EN":190},"Tạp chí Khoa học và Công nghệ nhiệt đới","Journal of Tropical Science and Engineering",{"VOID":192},"08667535","2025-10-27T06:27:25.058+00:00",[101,102],[],[],[],"https:\u002F\u002Ftapchikhcnnd.com.vn",{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":200,"totalPublicationByYear":201,"totalCitation":161,"totalCitationByYear":203,"totalCitationPerPublication":153,"totalCitationPerPublicationByYear":205,"hindexLast5Year":114,"hindex":114},481,{"0":115,"2020":115,"2021":115,"2022":114,"2024":115,"2025":202,"2026":115},474,{"2017":114,"2018":115,"2019":111,"2020":162,"2021":162,"2022":116,"2023":50,"2024":162,"2025":204,"2026":52},52,{"2020":162,"2021":162,"2022":162,"2024":162,"2025":206,"2026":52},0.11,{"id":208,"createTime":209,"updateTime":210,"relativeEntities":211,"slug":212,"properties":213,"entityType":24,"verifyStatus":25,"verifyTime":221,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":222,"subjectFields":223,"manageAffiliations":224,"indexDatabases":225,"url":226,"thumbnailPath":26,"statistic":227,"gsStatistic":276,"type":175,"analyzePriority":26},"a3d1e82a-57e2-40f9-940e-f5fa8b9ef64a","2023-06-01T07:11:26.039+00:00","2026-06-18T23:33:28.573+00:00",[],"VNU-Journal-of-Science-Earth-and-Environmental-Sciences",{"issn":214,"title":216,"country":218,"gsId":219},{"VOID":215},"26159279",{"EN":217},"VNU Journal of Science: Earth and Environmental Sciences",{"VOID":15},{"VOID":220},"UmXD8vEAAAAJ","2023-06-01T07:17:59.210+00:00",27,[],[],[],"https:\u002F\u002Fjs.vnu.edu.vn\u002FEES",{"impactFactor":36,"impactFactorByYear":228,"i10Index":234,"i10IndexLast5Year":36,"totalPublication":235,"totalPublicationByYear":236,"totalCitation":246,"totalCitationByYear":247,"totalCitationPerPublication":261,"totalCitationPerPublicationByYear":262,"hindexLast5Year":103,"hindex":103},{"2010":229,"2012":40,"2013":230,"2014":230,"2015":231,"2016":54,"2017":171,"2018":109,"2019":110,"2020":57,"2021":232,"2022":233,"2023":151,"2024":58},0.02,0.04,0.09,0.31,0.4,19,656,{"2008":237,"2009":238,"2010":239,"2011":238,"2012":240,"2013":241,"2014":239,"2015":242,"2016":243,"2017":244,"2018":245,"2019":165,"2020":125,"2021":168,"2022":125,"2023":222,"2024":111},23,24,22,28,25,20,146,29,78,1038,{"2008":248,"2009":249,"2010":250,"2011":251,"2012":252,"2013":253,"2014":254,"2015":255,"2016":256,"2017":257,"2018":161,"2019":258,"2020":259,"2021":29,"2022":260},119,64,66,86,38,73,59,31,129,39,97,53,26,1.58,{"2008":263,"2009":264,"2010":59,"2011":265,"2012":266,"2013":267,"2014":268,"2015":269,"2016":270,"2017":271,"2018":272,"2019":272,"2020":273,"2021":274,"2022":275},5.17,2.67,3.58,1.36,2.92,2.68,1.55,0.88,1.34,1.37,1.47,1.24,0.72,{"impactFactor":26,"impactFactorByYear":26,"i10Index":173,"i10IndexLast5Year":135,"totalPublication":277,"totalPublicationByYear":278,"totalCitation":279,"totalCitationByYear":280,"totalCitationPerPublication":288,"totalCitationPerPublicationByYear":289,"hindexLast5Year":158,"hindex":298},113,{"2007":114,"2008":103,"2009":173,"2010":116,"2011":51,"2012":239,"2013":103,"2014":162,"2015":53,"2016":135},616,{"2009":162,"2010":114,"2011":52,"2012":124,"2013":222,"2014":255,"2015":48,"2016":44,"2017":281,"2018":282,"2019":259,"2020":283,"2021":284,"2022":285,"2023":286,"2024":257,"2025":287,"2026":59},54,60,49,47,34,44,33,5.45,{"2009":290,"2010":291,"2011":292,"2012":293,"2013":294,"2014":295,"2015":296,"2016":297},0.28,0.2,0.6,0.77,2.25,6.2,3.91,9.67,14,{"id":300,"createTime":301,"updateTime":302,"relativeEntities":303,"slug":304,"properties":305,"entityType":24,"verifyStatus":25,"verifyTime":316,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":234,"subjectFields":317,"manageAffiliations":318,"indexDatabases":388,"url":389,"thumbnailPath":390,"statistic":391,"gsStatistic":409,"type":175,"analyzePriority":26},"a7166325-6c9e-4db3-8a59-7c879701a372","2023-07-31T04:28:49.231+00:00","2026-06-18T23:33:22.428+00:00",[],"VNU-Journal-of-Science-Policy-and-Management-Studies",{"country":306,"issn":307,"eissn":309,"title":311,"gsId":314},{"VOID":15},{"VOID":308},"26159295",{"VOID":310},"25881116",{"EN":312,"VI":313},"VNU Journal of Science: Policy and Management Studies","Tạp chí Nghiên cứu Chính sách và Quản lý",{"VOID":315},"xKW2E_cAAAAJ","2023-08-01T03:23:46.688+00:00",[],[319],{"id":320,"createTime":321,"updateTime":322,"relativeEntities":323,"slug":324,"properties":325,"entityType":98,"verifyStatus":25,"verifyTime":335,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":336,"url":337,"parentIds":338,"statistic":339},"12466116-8f60-4b01-8faf-2411483a0977","2023-05-30T09:37:38.472+00:00","2026-06-19T02:14:28.352+00:00",[],"Vietnam-National-University",{"country":326,"title":327,"abbreviation":330,"address":332},{"VOID":15},{"EN":328,"VI":329},"Vietnam National University, Hanoi","Đại học Quốc gia Hà Nội",{"VOID":331},"VNU",{"VI":333,"EN":334},"Số 144 Xuân Thủy, Phường Dịch Vọng Hậu, Quận Cầu Giấy, Hà Nội, Việt Nam","No. 144 Xuan Thuy Street, Dich Vong Hau Ward, Cau Giay District, Hanoi, Vietnam","2023-08-02T13:58:17.029+00:00",16,"http:\u002F\u002Fwww.vnu.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":340,"i10Index":285,"i10IndexLast5Year":162,"totalPublication":344,"totalPublicationByYear":345,"totalCitation":354,"totalCitationByYear":355,"totalCitationPerPublication":368,"totalCitationPerPublicationByYear":369,"hindexLast5Year":336,"hindex":336},{"2014":109,"2015":231,"2016":231,"2017":206,"2018":341,"2019":110,"2020":342,"2021":343,"2022":171,"2023":231,"2024":110,"2025":39},0.06,0.18,0.35,1247,{"2003":115,"2004":115,"2005":114,"2006":59,"2007":111,"2008":162,"2009":59,"2010":50,"2011":124,"2012":336,"2013":260,"2014":244,"2015":250,"2016":281,"2017":346,"2018":347,"2019":348,"2020":349,"2021":350,"2022":351,"2023":352,"2024":353,"2025":255,"2026":50},94,88,83,67,176,185,187,93,1644,{"2004":111,"2005":115,"2006":52,"2007":298,"2008":356,"2009":298,"2010":286,"2011":357,"2012":244,"2013":358,"2014":359,"2015":360,"2016":361,"2017":362,"2018":363,"2019":364,"2020":365,"2021":366,"2022":367,"2023":367,"2024":162},13,81,48,70,151,115,109,259,174,181,121,101,1.32,{"2004":111,"2005":370,"2006":59,"2007":371,"2008":372,"2009":373,"2010":374,"2011":375,"2012":376,"2013":377,"2014":378,"2015":379,"2016":380,"2017":381,"2018":382,"2019":383,"2020":384,"2021":385,"2022":386,"2023":387,"2024":109},0.5,3.5,2.6,4.67,5.5,4.76,1.81,1.85,2.41,2.29,2.13,1.16,2.94,2.1,2.7,0.69,0.55,0.54,[],"https:\u002F\u002Fjs.vnu.edu.vn\u002FPaM","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002Fa7166325-6c9e-4db3-8a59-7c879701a372\u002Fecfe83f4bcc60c7023ae04d8900fe0ac.jpg",{"impactFactor":36,"impactFactorByYear":392,"i10Index":111,"i10IndexLast5Year":36,"totalPublication":394,"totalPublicationByYear":395,"totalCitation":399,"totalCitationByYear":400,"totalCitationPerPublication":293,"totalCitationPerPublicationByYear":403,"hindexLast5Year":158,"hindex":158},{"2018":109,"2019":171,"2020":393,"2021":108,"2022":54,"2023":206,"2024":54},0.23,320,{"2015":50,"2016":239,"2017":286,"2018":396,"2019":397,"2020":159,"2021":398,"2022":168,"2023":79,"2024":255},30,35,40,247,{"2015":115,"2016":242,"2017":401,"2018":222,"2019":402,"2020":79,"2021":239,"2022":50,"2023":116},77,50,{"2015":404,"2016":169,"2017":405,"2018":406,"2019":407,"2020":408,"2021":386,"2022":291,"2023":232},0.12,1.75,0.9,1.43,0.86,{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":103,"totalPublicationByYear":410,"totalCitation":234,"totalCitationByYear":411,"totalCitationPerPublication":261,"totalCitationPerPublicationByYear":412,"hindexLast5Year":114,"hindex":59},{"2015":114,"2016":116},{"2016":115,"2017":114,"2018":114,"2019":59,"2020":114,"2021":59,"2022":114,"2023":114,"2024":115,"2026":115},{"2016":108},{"id":414,"createTime":415,"updateTime":416,"relativeEntities":417,"slug":418,"properties":419,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":238,"subjectFields":428,"manageAffiliations":429,"indexDatabases":430,"url":431,"thumbnailPath":26,"statistic":432,"gsStatistic":438,"type":175,"analyzePriority":26},"16e65a3f-d274-47dd-8691-56d76eb58c3d","2023-05-30T09:10:06.062+00:00","2026-06-18T23:33:17.679+00:00",[],"Vietnam-Journal-of-Otorhinolaryngology-Head-and-Neck-Surgery",{"country":420,"issn":421,"title":423,"gsId":426},{"VOID":15},{"VOID":422},"18593704",{"EN":424,"VI":425},"Vietnam Journal of Otorhinolaryngology - Head and Neck Surgery","Tạp chí Tai Mũi Họng Việt Nam",{"VOID":427},"L78B_eIAAAAJ",[],[],[],"https:\u002F\u002Ftapchitaimuihong.vn\u002Findex.php\u002Ftmh",{"impactFactor":36,"impactFactorByYear":433,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":434,"totalPublicationByYear":435,"totalCitation":111,"totalCitationByYear":436,"totalCitationPerPublication":230,"totalCitationPerPublicationByYear":437,"hindexLast5Year":115,"hindex":115},{"2024":229},95,{"2022":52,"2023":286,"2024":255,"2025":53},{"2023":111},{"2023":231},{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":240,"totalPublicationByYear":439,"totalCitation":234,"totalCitationByYear":440,"totalCitationPerPublication":441,"totalCitationPerPublicationByYear":442,"hindexLast5Year":114,"hindex":114},{"2023":53,"2024":116,"2025":135,"2026":115},{"2024":59,"2025":298,"2026":114},0.68,{"2024":443,"2025":444,"2026":114},0.3,2.33,{"id":446,"createTime":447,"updateTime":448,"relativeEntities":449,"slug":450,"properties":451,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":396,"subjectFields":460,"manageAffiliations":461,"indexDatabases":462,"url":463,"thumbnailPath":464,"statistic":465,"gsStatistic":472,"type":175,"analyzePriority":26},"25988add-c322-4eda-afda-63b1559bb824","2023-04-07T03:49:55.817+00:00","2026-06-18T23:32:23.776+00:00",[],"T%E1%BA%A1p%20ch%C3%AD%20Y%20-%20D%C6%B0%E1%BB%A3c%20h%E1%BB%8Dc%20qu%C3%A2n%20s%E1%BB%B1",{"country":452,"issn":453,"title":455,"gsId":458},{"VOID":15},{"VOID":454},"18590748",{"EN":456,"VI":457},"Journal of Military Pharmaco-medicine","Tạp chí Y - Dược học quân sự",{"VOID":459},"_pmQ8IEAAAAJ",[],[],[],"https:\u002F\u002Fjmpm.vn\u002Findex.php\u002Fjmpm","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F25988add-c322-4eda-afda-63b1559bb824\u002F09c6bc42157cf5ece95edc971ccddb52.jpg",{"impactFactor":36,"impactFactorByYear":466,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":467,"totalPublicationByYear":468,"totalCitation":135,"totalCitationByYear":470,"totalCitationPerPublication":38,"totalCitationPerPublicationByYear":471,"hindexLast5Year":115,"hindex":115},{"2023":229,"2024":38},475,{"2022":168,"2023":365,"2024":469,"2025":124},236,{"2022":114,"2023":111},{"2022":109,"2023":229},{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":277,"totalPublicationByYear":473,"totalCitation":401,"totalCitationByYear":474,"totalCitationPerPublication":441,"totalCitationPerPublicationByYear":475,"hindexLast5Year":59,"hindex":59},{"2015":115,"2018":114,"2019":115,"2020":115,"2021":59,"2022":103,"2023":159,"2024":287,"2025":237},{"2020":115,"2021":115,"2022":115,"2023":52,"2024":237,"2025":79,"2026":116},{"2020":115,"2021":476,"2022":171,"2023":477,"2024":478,"2025":479},0.33,0.24,0.7,1.39,{"id":481,"createTime":482,"updateTime":483,"relativeEntities":484,"slug":485,"properties":486,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":496,"translateLanguages":26,"viewCount":45,"subjectFields":497,"manageAffiliations":498,"indexDatabases":525,"url":526,"thumbnailPath":527,"statistic":528,"gsStatistic":26,"type":26,"analyzePriority":26},"2b8d7b12-2d20-4777-be98-077f44f03c69","2023-09-07T07:40:58.286+00:00","2025-07-13T21:21:00.542+00:00",[],"VNU-Journal-of-Social-Sciences-and-Humanities",{"country":487,"issn":488,"introduce":490,"title":493},{"VOID":15},{"VOID":489},"23541172",{"EN":491,"VI":492},"{\"ops\":[{\"insert\":\"VNU Journal of Social Sciences and Humanities (ISSN 2354-1172) is a double-blind peer-reviewed journal published by University of Social Sciences and Humanities, Vietnam National University, Hanoi, Vietnam, under the publication permit no. 155\u002FGP-BTTTT, issued on 11\"},{\"attributes\":{\"script\":\"super\"},\"insert\":\"th \"},{\"insert\":\"May, 2015 by Ministry of Information and Communications. The journal publishes four Vietnamese issues and two English issues per year.\\nCurrently, there are 35 reputable professors in the editorial board. The main objectives of the journal include: providing an intellectual platform for Vietnamese and international scholars; promoting interdisciplinary studies in social sciences and humanities; becoming the leading journal in social sciences and humanities in Vietnam; being indexed by worldwide databases and having academic recognition internationally in the near future.\\nThe journal is currently indexed by Google Scholar, WorldCat, Open Archives, Cosmos Impact Factor, Advanced Sciences Index, Scientific Indexing Services, CrossRef, EBSCO Information Services and Vietnam National University’s digital archive.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Journal of Social Sciences and Humanities-Vietnam\"},{\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"ISSN 2354-1172, email: tapchikhxhnv@gmail.com, tckhxhnv@vnu.edu.vn\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Được thành lập ngày 31\u002F8\u002F2015 (giấy phép hoạt động số 155\u002FGP-BVHTT ngày 11 tháng 5 năm 2015 của Bộ Thông tin và Truyền thông, mã số tiêu chuẩn quốc tế ISSN 2354-1172), Tạp chí Khoa học Xã hội và Nhân văn (Journal of Social Sciences and Humanities) là ấn phẩm khoa học chính thức, duy nhất của Trường Đại học Khoa học Xã hội và Nhân văn, ĐHQG Hà Nội, phát triển và kế thừa Chuyên san Khoa học Xã hội và Nhân văn, Tạp chí Khoa học, ĐHQG Hà Nội.\\nTạp chí xuất bản định kỳ (04 số tiếng Việt\u002Fnăm và 02 số tiếng Anh\u002Fnăm), có nhiệm vụ \"},{\"attributes\":{\"italic\":true},\"insert\":\"công bố, giới thiệu các công trình nghiên cứu khoa học khoa học xã hội và nhân văn của các tác giả là các nhà khoa học trong và ngoài nước, phục vụ giảng dạy, học tập và nghiên cứu khoa học\"},{\"insert\":\". Hội đồng biên tập của Tạp chí hiện bao gồm 33 nhà khoa học có uy tín trong nước và quốc tế. Tạp chí tập trung và ưu tiên đăng tải những bài báo theo định hướng của tinh thần cởi mở, sáng tạo, nhanh chóng vươn lên để tiếp cận và sánh ngang với các tạp chí có uy tín hàng đầu của khu vực và trên thế giới. Nội dung chính của Tạp chí bao gồm các Bài nghiên cứu (khoảng 6000 đến 15000 từ), các bài điểm sách, thông tin khoa học (khoảng 300 đến 1500 từ) được trình bày theo đúng cấu trúc và chuẩn mực của một tạp chí khoa học.\\nCác bài viết của Tạp chí hiện đang được trích dẫn bởi Google Scholar, WorldCat, Open Archives, Cosmos Impact Factor, Advanced Sciences Index, Scientific Indexing Services, CrossRef, EBSCO Information Services.\\nMọi thông tin xin liên hệ: \"},{\"attributes\":{\"italic\":true},\"insert\":\"Phòng Tạp chí, 701 - E, Trường Đại học Khoa học Xã hội và Nhân văn, 336 Nguyễn Trãi, Thanh Xuân, Hà Nội. ĐT: 024.35581984; email: tckhxhnv@vnu.edu.vn \"},{\"insert\":\"hoặc \"},{\"attributes\":{\"italic\":true},\"insert\":\"tapchikhxhnv@gmail.com \"},{\"insert\":\"\\n\"}]}",{"EN":494,"VI":495},"VNU Journal of Social Sciences and Humanities","Tạp chí Khoa học Xã hội và Nhân văn",[101,102],[],[499],{"id":500,"createTime":501,"updateTime":502,"relativeEntities":503,"slug":504,"properties":505,"entityType":98,"verifyStatus":25,"verifyTime":509,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":222,"url":26,"parentIds":510,"statistic":511},"8b6e349b-0daf-4895-9c3f-85f30f1bfd42","2023-07-31T12:55:58.430+00:00","2026-06-19T02:30:07.899+00:00",[],"Tr%C6%B0%E1%BB%9Dng-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Khoa-h%E1%BB%8Dc-X%C3%A3-h%E1%BB%99i-v%C3%A0-Nh%C3%A2n-v%C4%83n-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-H%C3%A0-N%E1%BB%99i",{"title":506},{"EN":507,"VI":508},"VNU University of Social Sciences and Humanities","Trường Đại học Khoa học Xã hội và Nhân văn, Đại học Quốc gia Hà Nội","2023-08-02T15:28:49.057+00:00",[],{"impactFactor":36,"impactFactorByYear":512,"i10Index":59,"i10IndexLast5Year":115,"totalPublication":514,"totalPublicationByYear":515,"totalCitation":518,"totalCitationByYear":519,"totalCitationPerPublication":520,"totalCitationPerPublicationByYear":521,"hindexLast5Year":162,"hindex":162},{"2016":229,"2017":230,"2018":229,"2021":230,"2022":58,"2023":513,"2024":38},0.15,365,{"2013":115,"2014":158,"2015":125,"2016":252,"2017":44,"2018":516,"2019":286,"2020":396,"2021":259,"2022":517,"2023":396,"2024":115,"2025":59,"2026":115},21,42,169,{"2015":283,"2016":135,"2017":52,"2018":50,"2019":298,"2020":53,"2021":359,"2022":115,"2023":115},0.46,{"2015":266,"2016":57,"2017":57,"2018":522,"2019":523,"2020":524,"2021":368,"2022":229,"2023":39},0.38,0.32,0.37,[],"http:\u002F\u002Fjournal.ussh.vnu.edu.vn\u002Findex.php\u002Fvjossh","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F2b8d7b12-2d20-4777-be98-077f44f03c69\u002F0bd0751202944a4b4165b482e6e623e4.png",{"impactFactor":36,"impactFactorByYear":529,"i10Index":162,"i10IndexLast5Year":115,"totalPublication":530,"totalPublicationByYear":531,"totalCitation":537,"totalCitationByYear":538,"totalCitationPerPublication":343,"totalCitationPerPublicationByYear":540,"hindexLast5Year":135,"hindex":135},{"2016":341,"2017":39,"2018":229,"2019":38,"2020":110,"2021":231,"2022":231,"2023":341,"2024":39},764,{"2015":255,"2016":245,"2017":532,"2018":259,"2019":533,"2020":534,"2021":535,"2022":536,"2023":534,"2024":254,"2025":50},111,106,68,92,89,265,{"2015":539,"2016":241,"2017":168,"2018":51,"2019":349,"2020":260,"2021":244,"2022":298,"2023":114},46,{"2015":541,"2016":523,"2017":524,"2018":290,"2019":542,"2020":522,"2021":523,"2022":57,"2023":39},1.48,0.63,{"id":544,"createTime":545,"updateTime":546,"relativeEntities":547,"slug":548,"properties":549,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":558,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":50,"subjectFields":559,"manageAffiliations":560,"indexDatabases":561,"url":562,"thumbnailPath":563,"statistic":564,"gsStatistic":26,"type":26,"analyzePriority":26},"6ec01bd0-15c0-469a-86ac-41339076ae0a","2023-08-10T07:08:33.153+00:00","2026-01-31T21:19:06.362+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Da-li%E1%BB%85u-h%E1%BB%8Dc-Vi%E1%BB%87t-Nam",{"country":550,"issn":551,"introduce":553,"title":555},{"VOID":15},{"VOID":552},"18594824",{"VI":554},"{\"ops\":[{\"insert\":\"Tạp chí “Da liễu học Việt Nam” (Tiếng Anh: Vietnamese Journal of Dermatology and Venereology) thuộc Hội Da liễu Việt Nam, xuất bản 4 số mỗi năm bằng tiếng Việt hoặc tiếng Anh.\\nTạp chí Da liễu học Việt Nam hoạt động với mục đích, tôn chỉ là phổ biến, trao đổi thông tin trong lĩnh vực chuyên ngành da liễu; đăng tải các công trình nghiên cứu khoa học; chuyển giao công nghệ - kinh tế và khoa học kỹ thuật liên quan đến lĩnh vực da liễu.\\nPhạm vi của tạp chí là tất cả các bài báo khoa học, bài tổng quan, giới thiệu ca lâm sàng, … có liên quan tới chuyên ngành da liễu trong và ngoài nước. Tạp chí công bố các công trình nghiên cứu liên quan đến mô hình bệnh tật, các phương pháp chẩn đoán, điều trị, dự phòng và phục hồi chức năng các bệnh thuộc chuyên ngành da liễu. Ngoài ra, tạp chí còn đăng tải các bài tổng quan, cập nhật thông tin, kiến thức, hướng dẫn chẩn đoán, điều trị trong chuyên ngành da liễu trong nước và quốc tế; đăng tải các bài ca lâm sàng đặc biệt trong chuyên ngành da liễu.\\nTạp chí Da liễu học Việt Nam được biết tới là một tạp chí chuyên ngành có uy tín trong lĩnh vực da liễu. Các bài báo về nghiên cứu khoa học đăng trong Tạp chí được bình duyệt một cách nghiêm ngặt bởi ít nhất 2 chuyên gia. Hội đồng biên tập tạp chí bao gồm các nhà khoa học có uy tín (Giáo sư, Phó Giáo sư, Tiến sĩ, Bác sĩ…) trong chuyên ngành da liễu nhằm đảm bảo chất lượng và tính khách quan, khoa học cho các bài viết đăng trên Tạp chí.\\n\"}]}",{"EN":556,"VI":557},"Vietnamese Journal of Dermatology and Venereology","Tạp chí Da liễu học Việt Nam","Admin Import",[],[],[],"https:\u002F\u002Fvjdv.vn\u002Findex.php\u002Fvjdv","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F6ec01bd0-15c0-469a-86ac-41339076ae0a\u002F3cbc81720e58429dc7b1c4d7ab1935ca.jpg",{"impactFactor":36,"impactFactorByYear":565,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":566,"totalPublicationByYear":567,"totalCitation":116,"totalCitationByYear":570,"totalCitationPerPublication":109,"totalCitationPerPublicationByYear":571,"hindexLast5Year":115,"hindex":115},{"2023":38,"2024":230},182,{"2022":568,"2023":45,"2024":569},69,56,{"2022":52,"2023":115},{"2022":40,"2023":229},{"id":573,"createTime":574,"updateTime":575,"relativeEntities":576,"slug":577,"properties":578,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":587,"translateLanguages":26,"viewCount":283,"subjectFields":588,"manageAffiliations":589,"indexDatabases":647,"url":648,"thumbnailPath":649,"statistic":650,"gsStatistic":26,"type":26,"analyzePriority":26},"19221551-7519-47ff-a892-331d1139c64b","2023-09-12T07:03:05.744+00:00","2026-01-24T20:54:40.144+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-S%E1%BB%A9c-kho%E1%BA%BB-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-Th%C3%A0nh-ph%E1%BB%91-H%E1%BB%93-Ch%C3%AD-Minh",{"country":579,"issn":580,"introduce":582,"title":584},{"VOID":15},{"VOID":581},"27349446",{"EN":583},"{\"ops\":[{\"attributes\":{\"bold\":true},\"insert\":\"1. History\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Science and Technology Development Journal\"},{\"insert\":\" (STDJ) (ISSN 2734-9446), Vietnam National University - Ho Chi Minh City (VNU-HCM) was established in 1997. And the first issue was published in January 1998 with ISSN 1859-0128. Since then, STDJ has become the most important scientific forum of scientists from VNU-HCM as well as other universities. The magazine has undergone 20 years of development and has become a bridge for scientific exchanges, as well as enriching reference materials for the faculty, doctoral students, students of VNU-HCM in particular and other universities, institutes...\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Science and Technology Development Journal - Health Sciences (STDJ-HS) is a subjournal of Science and Technology Development Journal since 2020.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\" \"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"2. Focus and Scope\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Publishing articles with contents on healthcare, research projects in the field of health, advanced directions in health education and management. Therefore, STDJ-HS will accept articles from doctors, administrators, teachers, researchers, graduate students and fellows. The authors will be responsible for the accuracy of the data, opinions, opinions and material cited in the article.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Facilitating the exchange of scientific and technological information and act as a bridge between theory and practice in the community of educators, scientists, managers, policy makers and enterprises in and out of the country.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"EN":585,"VI":586},"VNUHCM JOURNAL OF HEALTH SCIENCES","Tạp chí Khoa học Sức khoẻ Đại học Quốc gia Thành phố Hồ Chí Minh",[101,102],[],[590],{"id":591,"createTime":592,"updateTime":593,"relativeEntities":594,"slug":595,"properties":596,"entityType":98,"verifyStatus":25,"verifyTime":606,"verifyNote":26,"syncStatus":28,"languages":607,"translateLanguages":26,"viewCount":608,"url":609,"parentIds":610,"statistic":611},"fc4c2560-868c-4677-acb1-8686bef88727","2023-06-26T04:48:23.774+00:00","2026-06-19T01:46:17.248+00:00",[],"%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-Th%C3%A0nh-ph%E1%BB%91-H%E1%BB%93-Ch%C3%AD-Minh",{"country":597,"title":598,"abbreviation":601,"address":603},{"VOID":15},{"EN":599,"VI":600},"Vietnam National University Ho Chi Minh City","Đại học Quốc gia Thành phố Hồ Chí Minh",{"VOID":602},"VNUHCM",{"VI":604,"EN":605},"khu phố 6, Phường Linh Trung, Thành phố Thủ Đức, Thành phố Hồ Chí Minh, Việt Nam","Quarter 6, Linh Trung Ward, Thu Duc City, Ho Chi Minh City, Vietnam","2023-08-16T14:13:07.134+00:00",[101,102],45,"https:\u002F\u002Fvnuhcm.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":612,"i10Index":285,"i10IndexLast5Year":51,"totalPublication":613,"totalPublicationByYear":614,"totalCitation":624,"totalCitationByYear":625,"totalCitationPerPublication":634,"totalCitationPerPublicationByYear":635,"hindexLast5Year":124,"hindex":124},{"2014":36,"2015":38,"2016":109,"2017":39,"2018":229,"2019":38,"2020":110,"2021":171,"2022":110,"2023":110,"2024":171,"2025":229},3708,{"2005":115,"2006":115,"2007":115,"2008":135,"2009":111,"2010":53,"2011":52,"2012":568,"2013":615,"2014":351,"2015":616,"2016":469,"2017":617,"2018":127,"2019":618,"2020":619,"2021":620,"2022":621,"2023":622,"2024":623,"2025":159,"2026":50},164,266,177,226,603,931,314,246,74,2399,{"2006":115,"2008":50,"2010":162,"2011":242,"2012":222,"2013":43,"2014":626,"2015":627,"2016":628,"2017":629,"2018":258,"2019":630,"2020":631,"2021":632,"2022":633,"2023":353,"2024":115},250,124,157,162,152,385,559,128,0.65,{"2006":115,"2008":636,"2010":637,"2011":638,"2012":639,"2013":522,"2014":640,"2015":641,"2016":642,"2017":643,"2018":644,"2019":642,"2020":645,"2021":292,"2022":646,"2023":522,"2024":38},1.33,0.45,2.22,0.39,1.35,0.47,0.67,0.92,0.73,0.64,0.41,[],"http:\u002F\u002Fstdjhs.scienceandtechnology.com.vn\u002Findex.php\u002Fstdjhs","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F19221551-7519-47ff-a892-331d1139c64b\u002F2e10768b7d1e380c36a25ed0c714dd7e.png",{"impactFactor":36,"impactFactorByYear":651,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":652,"totalPublicationByYear":653,"totalCitation":516,"totalCitationByYear":654,"totalCitationPerPublication":151,"totalCitationPerPublicationByYear":655,"hindexLast5Year":59,"hindex":59},{"2022":57,"2023":108,"2024":39},79,{"2020":116,"2021":240,"2022":239,"2023":52,"2024":162,"2025":162},{"2020":59,"2021":51,"2022":59},{"2020":443,"2021":387,"2022":54},{"code":657,"data":658,"meta":26},"SUCCESS",{"id":659,"createTime":660,"updateTime":661,"relativeEntities":662,"slug":663,"properties":664,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":675,"manageAffiliations":724,"indexDatabases":745,"url":789,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},"fc949bdc-33b8-4a3e-87c0-91f892e0f3d1","2023-05-29T11:23:13.568+00:00","2025-11-21T10:02:17.144+00:00",[],"International-Journal-of-Robotics-Research",{"country":665,"issn":667,"introduce":669,"eissn":671,"title":673},{"VOID":666},"US",{"VOID":668},"02783649",{"EN":670},"It is the policy of The International Journal of Robotics Research to encourage the application of theoretical advances to real problems and data. Results should represent a significant rather than incremental advance, and should be verified appropriately according to the topic. Experimental results are strongly encouraged. There should be an up to date literature review, and meaningful comparisons with previous work to demonstrate any proposed advance. All articles that pass initial editorial assessment are peer-reviewed by independent referees.",{"VOID":672},"17413176",{"EN":674},"International Journal of Robotics Research",[676,684,692,700,708,716],{"id":677,"createTime":678,"updateTime":679,"relativeEntities":680,"label":681,"description":683,"parentId":26,"standard":26,"scholarHubFieldId":26},"6a3cb349-a9fc-40fb-9aa8-c9946de1e629","2023-05-29T10:24:01.672+00:00","2023-11-21T06:16:02.793+00:00",[],{"EN":682},"Artificial Intelligence",{},{"id":685,"createTime":686,"updateTime":687,"relativeEntities":688,"label":689,"description":691,"parentId":26,"standard":26,"scholarHubFieldId":26},"3ca6493e-aecd-4733-965c-52fbf88fe329","2023-05-29T10:24:06.812+00:00","2023-11-21T07:36:36.362+00:00",[],{"EN":690},"Electrical and Electronic Engineering",{},{"id":693,"createTime":694,"updateTime":695,"relativeEntities":696,"label":697,"description":699,"parentId":26,"standard":26,"scholarHubFieldId":26},"78a58205-ad3c-44c8-884e-f16b78feebfa","2023-05-29T10:24:10.811+00:00","2023-11-21T08:08:48.011+00:00",[],{"EN":698},"Modeling and Simulation",{},{"id":701,"createTime":702,"updateTime":703,"relativeEntities":704,"label":705,"description":707,"parentId":26,"standard":26,"scholarHubFieldId":26},"ee33e266-088e-4829-aa2f-5ea59917dac0","2023-05-29T10:24:03.075+00:00","2023-11-21T08:08:48.024+00:00",[],{"EN":706},"Applied Mathematics",{},{"id":709,"createTime":710,"updateTime":711,"relativeEntities":712,"label":713,"description":715,"parentId":26,"standard":26,"scholarHubFieldId":26},"aae089e7-8b62-4df4-ab86-aada3693b3f8","2023-05-29T10:24:07.736+00:00","2023-11-21T07:29:12.850+00:00",[],{"EN":714},"Software",{},{"id":717,"createTime":718,"updateTime":719,"relativeEntities":720,"label":721,"description":723,"parentId":26,"standard":26,"scholarHubFieldId":26},"5587dea8-ebb6-4a42-8493-b6dd63ea819a","2023-05-29T10:24:08.061+00:00","2023-11-21T07:32:48.048+00:00",[],{"EN":722},"Mechanical Engineering",{},[725,735],{"id":726,"createTime":727,"updateTime":728,"relativeEntities":729,"slug":730,"properties":731,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":111,"url":26,"parentIds":734,"statistic":26},"1fb862be-2e5e-4d4c-9b3b-d425662107ce","2023-05-29T10:24:07.858+00:00","2025-11-21T10:07:13.834+00:00",[],"SAGE-Publications-Inc-",{"title":732},{"EN":733},"SAGE Publications Inc.",[],{"id":736,"createTime":737,"updateTime":738,"relativeEntities":739,"slug":740,"properties":741,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":162,"url":26,"parentIds":744,"statistic":26},"14113943-0a59-44ad-919d-1cfb925967a0","2023-05-29T10:24:04.785+00:00","2025-11-21T10:07:12.084+00:00",[],"SAGE-Publications-Ltd",{"title":742},{"EN":743},"SAGE Publications Ltd",[],[746,770],{"id":747,"indexDatabase":748,"url":760,"indexYears":761,"academicFieldIds":762,"indexDatabaseRanking":769},"0825ad28-4264-4424-b250-0bae57d960a2",{"id":749,"createTime":750,"updateTime":751,"relativeEntities":752,"label":753,"description":755,"key":757,"publicationTags":758,"standard":26},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9","2023-05-22T09:57:18.509+00:00","2025-11-21T10:07:52.274+00:00",[],{"EN":754,"VI":754},"Scopus - Elsevier",{"EN":754,"VI":756},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[759],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F18050","1982-2025",[763,764,765,766,767,768],"09f6b045-208a-4e88-8bae-2e53a1e1a893","a81768cc-7885-48eb-a85a-170d5a0a5f4f","ea95f5ee-62c8-4ccb-8e3e-d3a8bc9e97cb","f8ab36fc-bc72-48f2-a425-9f3e042f2272","9d2ac5e3-41a0-4e3f-9001-acfb87e489bc","f58e9119-c14c-473f-8a7c-5a035e4ab69a","SCOPUS__Q1",{"id":771,"indexDatabase":772,"url":786,"indexYears":26,"academicFieldIds":787,"indexDatabaseRanking":26},"d1a2b1a4-f742-4a7d-a394-4cbc882261df",{"id":773,"createTime":774,"updateTime":775,"relativeEntities":776,"label":777,"description":779,"key":782,"publicationTags":783,"standard":26},"a4921856-b128-4d9f-8f1f-e80813d3bbd4","2023-05-22T09:59:31.026+00:00","2025-11-21T10:07:52.153+00:00",[],{"EN":778,"VI":778},"ISI\u002FSCIE - Science Citation Index Expanded",{"VI":780,"EN":781},"Cơ sở dữ liệu SCIE","SCIE database","scie",[784,785],"SCIE","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0278-3649",[788],"668abc1c-b8ae-41dc-a323-431b43712ada","https:\u002F\u002Fjournals.sagepub.com\u002Fhome\u002Fijr",{"meta":791,"data":793},{"total":792},"50",[794,985,1135,1270,2106,2414,2581,2749,3003,3206],{"id":795,"createTime":796,"updateTime":797,"relativeEntities":798,"slug":799,"properties":800,"entityType":815,"verifyStatus":25,"verifyTime":816,"verifyNote":817,"syncStatus":28,"languages":818,"translateLanguages":819,"viewCount":36,"primaryUrl":820,"fullTextUrl":26,"authors":821,"publicationType":899,"publisherRelationship":900,"citationCount":933,"citationInfo":934,"publishDate":945,"publishYear":946,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":947,"isForceReanalyzing":984},"beca8367-dfed-42f7-bc3d-e538c9c47a2f","2024-10-01T13:33:21.181+00:00","2024-12-27T19:19:27.577+00:00",[],"Vision-meets-robotics-The-KITTI-dataset",{"mag":801,"keywords":803,"openalex":805,"abstract":807,"title":810,"doi":813},{"VOID":802},"2115579991",{"VI":804},"tập dữ liệu KITTI, robot di động, lái xe tự động, cảm biến, camera stereo, máy quét laser 3D, GPS, IMU",{"VOID":806},"W2115579991",{"EN":808,"VI":809},"\u003Cjats:p> We present a novel dataset captured from a VW station wagon for use in mobile robotics and autonomous driving research. In total, we recorded 6 hours of traffic scenarios at 10–100 Hz using a variety of sensor modalities such as high-resolution color and grayscale stereo cameras, a Velodyne 3D laser scanner and a high-precision GPS\u002FIMU inertial navigation system. The scenarios are diverse, capturing real-world traffic situations, and range from freeways over rural areas to inner-city scenes with many static and dynamic objects. Our data is calibrated, synchronized and timestamped, and we provide the rectified and raw image sequences. Our dataset also contains object labels in the form of 3D tracklets, and we provide online benchmarks for stereo, optical flow, object detection and other tasks. This paper describes our recording platform, the data format and the utilities that we provide. \u003C\u002Fjats:p>","\u003Cjats:p> Chúng tôi trình bày một tập dữ liệu mới được ghi lại từ một chiếc xe station wagon VW để phục vụ nghiên cứu về robot di động và lái xe tự động. Tổng cộng, chúng tôi đã ghi lại 6 giờ kịch bản giao thông với tần suất từ 10 đến 100 Hz, sử dụng nhiều phương thức cảm biến khác nhau như camera stereo màu và đen trắng độ phân giải cao, máy quét laser 3D Velodyne và hệ thống dẫn đường quán tính GPS\u002FIMU độ chính xác cao. Các kịch bản rất đa dạng, phản ánh các tình huống giao thông thực tế và trải dài từ các xa lộ, các khu vực nông thôn đến các cảnh trong thành phố với nhiều đối tượng tĩnh và động. Dữ liệu của chúng tôi đã được hiệu chỉnh, đồng bộ và gán thời gian, và chúng tôi cung cấp các chuỗi hình ảnh đã chỉnh sửa và thô. Tập dữ liệu của chúng tôi cũng chứa nhãn đối tượng dưới dạng các tracklet 3D, và chúng tôi cung cấp các bài kiểm tra trực tuyến cho stereo, dòng quang học, phát hiện đối tượng và các tác vụ khác. Bài báo này mô tả nền tảng ghi âm của chúng tôi, định dạng dữ liệu và các tiện ích mà chúng tôi cung cấp. \u003C\u002Fjats:p>",{"EN":811,"VI":812},"Vision meets robotics: The KITTI dataset","Tầm nhìn gặp gỡ robot: Tập dữ liệu KITTI",{"VOID":814},"10.1177\u002F0278364913491297","PUBLICATION","2024-10-01T13:33:21.180+00:00","Auto Verify",[102],[101],"https:\u002F\u002Fjournals.sagepub.com\u002Fdoi\u002F10.1177\u002F0278364913491297",[822,841,858,879],{"id":823,"sortIndex":115,"researcher":26,"roles":824,"affiliations":825,"properties":836},"83a6c39f-6b01-4c9f-ba96-1ed61180afb7",[],[826],{"id":827,"sortIndex":36,"affiliation":828,"properties":26},"b3d6ca6a-2514-4a59-880d-4a3c0da1e275",{"id":829,"createTime":830,"updateTime":830,"relativeEntities":831,"slug":832,"properties":833,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"68878c7e-29e0-4ac0-9f19-91de8a38b065","2024-10-01T13:33:21.208+00:00",[],"-Department-of-Measurement-and-Control-Systems-Karlsruhe-Institute-of-Technology-Germany-",{"title":834},{"EN":835},"[Department of Measurement and Control Systems, Karlsruhe Institute of Technology, Germany]",{"openalex":837,"title":839},{"VOID":838},"A5052123947",{"EN":840},"Philip Lenz",{"id":842,"sortIndex":114,"researcher":26,"roles":843,"affiliations":844,"properties":851},"f2fa2194-f1c5-4281-ad9b-05d703bb3fae",[],[845],{"id":846,"sortIndex":36,"affiliation":847,"properties":26},"c830c6f8-1987-4297-b670-2432d82b02bb",{"id":829,"createTime":830,"updateTime":830,"relativeEntities":848,"slug":832,"properties":849,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":850},{"EN":835},{"openalex":852,"orcid":854,"title":856},{"VOID":853},"A5091574711",{"VOID":855},"https:\u002F\u002Forcid.org\u002F0000-0003-4165-2075",{"EN":857},"Christoph Stiller",{"id":859,"sortIndex":36,"researcher":26,"roles":860,"affiliations":861,"properties":872},"da91402b-8c64-4de5-b7b3-3c06943001a3",[],[862],{"id":863,"sortIndex":36,"affiliation":864,"properties":26},"42f7cf9d-1c04-4f08-b648-d6321ebaddc3",{"id":865,"createTime":866,"updateTime":866,"relativeEntities":867,"slug":868,"properties":869,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"df730459-d3ea-4ebd-8aa0-a72f568cd85a","2024-10-01T13:33:21.198+00:00",[],"Karlsruhe-Institute-of-Technology-and-Max-Planck-Institute-for-Intelligent-Systems-T%C3%BCbingen-Germany",{"title":870},{"EN":871},"Karlsruhe Institute of Technology and Max Planck Institute for Intelligent Systems Tübingen, Germany",{"openalex":873,"orcid":875,"title":877},{"VOID":874},"A5016606943",{"VOID":876},"https:\u002F\u002Forcid.org\u002F0000-0002-8151-3726",{"EN":878},"Andreas Geiger",{"id":880,"sortIndex":59,"researcher":26,"roles":881,"affiliations":882,"properties":894},"8cf4c9eb-cdeb-4243-b64d-0bb66d924954",[],[883],{"id":884,"sortIndex":36,"affiliation":885,"properties":26},"3c0a1e07-9909-4772-8499-58b511a8b8bd",{"id":886,"createTime":887,"updateTime":888,"relativeEntities":889,"slug":890,"properties":891,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"f1741ef8-1169-4cdf-b7ac-aaf0aab844c9","2023-11-26T09:15:21.660+00:00","2024-10-01T13:33:21.225+00:00",[],"Toyota-Technological-Institute-at-Chicago-IL-USA",{"title":892},{"VI":893},"Toyota Technological Institute at Chicago, IL, USA",{"openalex":895,"title":897},{"VOID":896},"A5058557954",{"EN":898},"Raquel Urtasun","ARTICLE",{"url":26,"publisher":901,"properties":926},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":902,"slug":663,"properties":903,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":909,"manageAffiliations":910,"indexDatabases":911,"url":789,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":904,"issn":905,"introduce":906,"eissn":907,"title":908},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[912,919],{"id":771,"indexDatabase":913,"url":786,"indexYears":26,"academicFieldIds":918,"indexDatabaseRanking":26},{"id":773,"createTime":774,"updateTime":775,"relativeEntities":914,"label":915,"description":916,"key":782,"publicationTags":917,"standard":26},[],{"EN":778,"VI":778},{"VI":780,"EN":781},[784,785],[788],{"id":747,"indexDatabase":920,"url":760,"indexYears":761,"academicFieldIds":925,"indexDatabaseRanking":769},{"id":749,"createTime":750,"updateTime":751,"relativeEntities":921,"label":922,"description":923,"key":757,"publicationTags":924,"standard":26},[],{"EN":754,"VI":754},{"EN":754,"VI":756},[759],[763,764,765,766,767,768],{"volume":927,"pages":929,"issue":931},{"VOID":928},"32",{"VOID":930},"1231-1237",{"VOID":932},"11",7504,{"total":933,"publishYear":26,"statisticByYear":935},{"2012":114,"2013":162,"2014":47,"2015":615,"2016":936,"2017":937,"2018":938,"2019":939,"2020":940,"2021":941,"2022":942,"2023":943,"2024":944},192,302,540,918,1143,1253,1101,1178,660,"2013-09-01",2013,[948,951,954,957,960,963,966,969,972,975,978,981],{"id":26,"text":949,"url":26,"identifiers":950},"10.1109\u002FCVPR.2013.393",{"doi":949},{"id":26,"text":952,"url":26,"identifiers":953},"10.1109\u002FCVPR.2011.5995641",{"doi":952},{"id":26,"text":955,"url":26,"identifiers":956},"Geiger A, 2011, Conference on neural information processing systems (NIPS)",{},{"id":26,"text":958,"url":26,"identifiers":959},"10.1109\u002FCVPR.2012.6248074",{"doi":958},{"id":26,"text":961,"url":26,"identifiers":962},"Geiger A, 2012, International conference on robotics and automation (ICRA)",{},{"id":26,"text":964,"url":26,"identifiers":965},"10.1109\u002FIVS.2007.4290204",{"doi":964},{"id":26,"text":967,"url":26,"identifiers":968},"10.1177\u002F027836499501400301",{"doi":967},{"id":26,"text":970,"url":26,"identifiers":971},"Osborne P (2008) The mercator projections. Available at: http:\u002F\u002Fmercator.myzen.co.uk\u002Fmercator.pdf.",{},{"id":26,"text":973,"url":26,"identifiers":974},"10.1109\u002FROBOT.2010.5509587",{"doi":973},{"id":26,"text":976,"url":26,"identifiers":977},"10.1109\u002FIVS.2010.5548114",{"doi":976},{"id":26,"text":979,"url":26,"identifiers":980},"10.1109\u002FICRA.2012.6225282",{"doi":979},{"id":26,"text":982,"url":26,"identifiers":983},"Wojek C, 2012, Proceedings of the Intelligent Vehicles Symposium (IV)",{},false,{"id":986,"createTime":987,"updateTime":988,"relativeEntities":989,"slug":990,"properties":991,"entityType":815,"verifyStatus":25,"verifyTime":987,"verifyNote":817,"syncStatus":28,"languages":1006,"translateLanguages":1007,"viewCount":36,"primaryUrl":1008,"fullTextUrl":26,"authors":1009,"publicationType":899,"publisherRelationship":1032,"citationCount":1065,"citationInfo":1066,"publishDate":1080,"publishYear":1081,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1082,"isForceReanalyzing":984},"70a9216c-974b-49fc-a953-4730f0e4c702","2024-09-03T00:17:46.333+00:00","2024-12-28T15:00:00.377+00:00",[],"Real-Time-Obstacle-Avoidance-for-Manipulators-and-Mobile-Robots",{"mag":992,"keywords":994,"openalex":996,"abstract":998,"title":1001,"doi":1004},{"VOID":993},"2103120971",{"VI":995},"",{"VOID":997},"W2103120971",{"EN":999,"VI":1000},"\u003Cjats:p> This paper presents a unique real-time obstacle avoidance approach for manipulators and mobile robots based on the artificial potential field concept. Collision avoidance, tradi tionally considered a high level planning problem, can be effectively distributed between different levels of control, al lowing real-time robot operations in a complex environment. This method has been extended to moving obstacles by using a time-varying artificial patential field. We have applied this obstacle avoidance scheme to robot arm mechanisms and have used a new approach to the general problem of real-time manipulator control. We reformulated the manipulator con trol problem as direct control of manipulator motion in oper ational space—the space in which the task is originally described—rather than as control of the task's corresponding joint space motion obtained only after geometric and kine matic transformation. Outside the obstacles' regions of influ ence, we caused the end effector to move in a straight line with an upper speed limit. The artificial potential field ap proach has been extended to collision avoidance for all ma nipulator links. In addition, a joint space artificial potential field is used to satisfy the manipulator internal joint con straints. This method has been implemented in the COSMOS system for a PUMA 560 robot. Real-time collision avoidance demonstrations on moving obstacles have been performed by using visual sensing. \u003C\u002Fjats:p>","\u003Cjats:p> Bài báo này trình bày một phương pháp tránh va chạm độc đáo theo thời gian thực cho các cơ khí manipulator và robot di động dựa trên khái niệm trường tiềm năng nhân tạo. Việc tránh va chạm, thường được coi là một vấn đề lập kế hoạch cấp cao, có thể được phân phối hiệu quả giữa các cấp độ điều khiển khác nhau, cho phép các hoạt động của robot trong môi trường phức tạp diễn ra theo thời gian thực. Phương pháp này đã được mở rộng cho các chướng ngại vật di động bằng cách sử dụng trường tiềm năng nhân tạo thay đổi theo thời gian. Chúng tôi đã áp dụng phương thức tránh va chạm này cho các cơ cấu robot tay và đã sử dụng một cách tiếp cận mới đối với vấn đề tổng quát về điều khiển manipulator theo thời gian thực. Chúng tôi đã tái cấu trúc vấn đề điều khiển manipulator như là điều khiển trực tiếp chuyển động của manipulator trong không gian thao tác—không gian mà nhiệm vụ được mô tả ban đầu—thay vì điều khiển chuyển động không gian khớp tương ứng của nhiệm vụ chỉ được đạt được sau khi biến đổi hình học và động học. Ngoài các khu vực ảnh hưởng của chướng ngại vật, chúng tôi đã khiến bộ phận cuối cùng di chuyển theo một đường thẳng với giới hạn tốc độ tối đa. Phương pháp trường tiềm năng nhân tạo đã được mở rộng để tránh va chạm cho tất cả các liên kết của manipulator. Thêm vào đó, một trường tiềm năng nhân tạo trong không gian khớp được sử dụng để thỏa mãn các ràng buộc khớp bên trong của manipulator. Phương pháp này đã được triển khai trong hệ thống COSMOS cho robot PUMA 560. Các thử nghiệm tránh va chạm thời gian thực trên các chướng ngại vật di động đã được thực hiện bằng cách sử dụng cảm biến hình ảnh. \u003C\u002Fjats:p>",{"EN":1002,"VI":1003},"Real-Time Obstacle Avoidance for Manipulators and Mobile Robots","Tránh Va Chạm Thời Gian Thực cho Các Cơ Khí Manipulator và Robot Di Động",{"VOID":1005},"10.1177\u002F027836498600500106",[102],[101],"http:\u002F\u002Fjournals.sagepub.com\u002Fdoi\u002F10.1177\u002F027836498600500106",[1010],{"id":1011,"sortIndex":36,"researcher":26,"roles":1012,"affiliations":1013,"properties":1025},"dce55b37-3a36-40a2-8801-61c3006a4eb5",[],[1014],{"id":1015,"sortIndex":36,"affiliation":1016,"properties":26},"64fa3144-a719-41b2-8e59-f8793023afb9",{"id":1017,"createTime":1018,"updateTime":1019,"relativeEntities":1020,"slug":1021,"properties":1022,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"05c8f37e-9aff-49e2-a2aa-38610410b377","2024-09-03T00:17:46.347+00:00","2025-06-11T18:55:54.188+00:00",[],"Artificial-Intelligence-Laboratory-Stanford-University-Stanford-California-94305",{"title":1023},{"EN":1024},"Artificial Intelligence Laboratory Stanford University Stanford, California 94305",{"openalex":1026,"orcid":1028,"title":1030},{"VOID":1027},"A5051336665",{"VOID":1029},"https:\u002F\u002Forcid.org\u002F0000-0003-0482-1415",{"EN":1031},"Oussama Khatib",{"url":26,"publisher":1033,"properties":1058},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1034,"slug":663,"properties":1035,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1041,"manageAffiliations":1042,"indexDatabases":1043,"url":789,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":1036,"issn":1037,"introduce":1038,"eissn":1039,"title":1040},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[1044,1051],{"id":771,"indexDatabase":1045,"url":786,"indexYears":26,"academicFieldIds":1050,"indexDatabaseRanking":26},{"id":773,"createTime":774,"updateTime":775,"relativeEntities":1046,"label":1047,"description":1048,"key":782,"publicationTags":1049,"standard":26},[],{"EN":778,"VI":778},{"VI":780,"EN":781},[784,785],[788],{"id":747,"indexDatabase":1052,"url":760,"indexYears":761,"academicFieldIds":1057,"indexDatabaseRanking":769},{"id":749,"createTime":750,"updateTime":751,"relativeEntities":1053,"label":1054,"description":1055,"key":757,"publicationTags":1056,"standard":26},[],{"EN":754,"VI":754},{"EN":754,"VI":756},[759],[763,764,765,766,767,768],{"volume":1059,"pages":1061,"issue":1063},{"VOID":1060},"5",{"VOID":1062},"90-98",{"VOID":1064},"1",6449,{"total":1065,"publishYear":26,"statisticByYear":1067},{"2012":1068,"2013":1069,"2014":1070,"2015":1071,"2016":1072,"2017":1073,"2018":1074,"2019":1075,"2020":1076,"2021":351,"2022":1077,"2023":1078,"2024":1079},230,254,237,225,221,255,256,215,211,139,170,105,"1986-03-01",1986,[1083,1086,1089,1092,1095,1099,1102,1105,1108,1111,1114,1117,1120,1123,1126,1129,1132],{"id":26,"text":1084,"url":26,"identifiers":1085},"10.1109\u002FTSMC.1983.6313112",{"doi":1084},{"id":26,"text":1087,"url":26,"identifiers":1088},"Brooks, R., 1984, Aspects of mobile robot visual map making",{},{"id":26,"text":1090,"url":26,"identifiers":1091},"Buckley, C., 1985, The application of continuum methods to path planning. Ph.D. Thesis (in progress)",{},{"id":26,"text":1093,"url":26,"identifiers":1094},"Chatila, R., 1981, Système de navigation pour un robot mobile autonome: modélisation et processus décisionnels",{},{"id":26,"text":1096,"url":26,"identifiers":1097},"Hogan, N. 1984 June 6-8, San Diego, California. Impedance control: an approach to manipulation. 1984 Amer. Control Conf.",{"doi":1098},"10.23919\u002FACC.1984.4788393",{"id":26,"text":1100,"url":26,"identifiers":1101},"Khatib, O., 1978, Fonction decision-commande d'un robot manipulateur. Rapport No. 2\u002F7156. DERA\u002FCERT",{},{"id":26,"text":1103,"url":26,"identifiers":1104},"Khatib, O. and Le Maitre, J.F. 1978 September 12-15, Udine, Italy. Dynamic control of manipulators operating in a complex environment. Proc. 3rd CISM-IFToMM Symp. Theory Practice Robots Manipulators, 267-282. Elsevier . 1979.",{},{"id":26,"text":1106,"url":26,"identifiers":1107},"Khatib, O., 1980, Commande dynamique dans l'espace opérationnel des robots manipulateurs en présence d'obstacles. These de Docteur-Ingénieur",{},{"id":26,"text":1109,"url":26,"identifiers":1110},"Khatib, O. 1983 December 15-20, New Delhi. Dynamic control of manipulators in operational space. 6th CISM-IFToMM Congress Theory Machines Mechanisms , 1128-1131.",{},{"id":26,"text":1112,"url":26,"identifiers":1113},"Khatib, O., et al., 1984, Robotics in three acts (Film)",{},{"id":26,"text":1115,"url":26,"identifiers":1116},"Khatib, O. 1985 September 11-13, Tokyo. The operational space formulation in robot manipulators control. 15th Int. Symp. Indust. Robots.",{},{"id":26,"text":1118,"url":26,"identifiers":1119},"Khatib, O., 1985, Miami, Florida. Dynamic optimization in manipulator design: the operational space formulation. ASME Winter Annual Meeting",{},{"id":26,"text":1121,"url":26,"identifiers":1122},"Khatib, O., 1985, Robotics in three acts-Part II (Film)",{},{"id":26,"text":1124,"url":26,"identifiers":1125},"Krogh, B., 1984, August, Bethlehem, Pennsylvania. A generalized potential field approach to obstacle avoidance control. SME Canf. Proc. Robotics Research: The Next Five Years and Beyond",{},{"id":26,"text":1127,"url":26,"identifiers":1128},". Kuntze, H.B., and Schill, W. 1982 June 9-11, Paris. Methods for collision avoidance in computer controlled industrial robots. 12th ISIR",{},{"id":26,"text":1130,"url":26,"identifiers":1131},"Lozano-Perez, T., 1980, Spatial planning: a configuration space approach. AI Memo 605",{},{"id":26,"text":1133,"url":26,"identifiers":1134},"Moravec, H.P., 1980, Obstacle avoidance and navigation in the real world by a seeing robot rover. Ph.D. Thesis",{},{"id":1136,"createTime":1137,"updateTime":1137,"relativeEntities":1138,"slug":1139,"properties":1140,"entityType":815,"verifyStatus":25,"verifyTime":1152,"verifyNote":817,"syncStatus":28,"languages":1153,"translateLanguages":26,"viewCount":36,"primaryUrl":1154,"fullTextUrl":26,"authors":1155,"publicationType":899,"publisherRelationship":1176,"citationCount":1209,"citationInfo":1210,"publishDate":1216,"publishYear":1217,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1218,"isForceReanalyzing":984},"3422fd4f-dcc2-423e-9ebe-e8a32537923d","2024-10-08T01:30:01.340+00:00",[],"Passive-Dynamic-Walking",{"mag":1141,"keywords":1143,"openalex":1144,"abstract":1146,"title":1148,"doi":1150},{"VOID":1142},"2163668399",{},{"VOID":1145},"W2163668399",{"EN":1147},"\u003Cjats:p> There exists a class of two-legged machines for which walking is a natural dynamic mode. Once started on a shallow slope, a machine of this class will settle into a steady gait quite comparable to human walking, without active control or en ergy input. Interpretation and analysis of the physics are straightforward; the walking cycle, its stability, and its sensi tivity to parameter variations are easily calculated. Experi ments with a test machine verify that the passive walking effect can be readily exploited in practice. The dynamics are most clearly demonstrated by a machine powered only by gravity, but they can be combined easily with active energy input to produce efficient and dextrous walking over a broad range of terrain. \u003C\u002Fjats:p>",{"EN":1149},"Passive Dynamic Walking",{"VOID":1151},"10.1177\u002F027836499000900206","2024-10-08T01:30:01.339+00:00",[102],"https:\u002F\u002Fjournals.sagepub.com\u002Fdoi\u002F10.1177\u002F027836499000900206",[1156],{"id":1157,"sortIndex":36,"researcher":26,"roles":1158,"affiliations":1159,"properties":1171},"1c1f822c-ff14-41c8-8e53-a8a06fbb31b1",[],[1160],{"id":1161,"sortIndex":36,"affiliation":1162,"properties":26},"aa2592fc-2a59-4654-a335-e010b18e2839",{"id":1163,"createTime":1164,"updateTime":1165,"relativeEntities":1166,"slug":1167,"properties":1168,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"4c3d9342-87f4-48a4-a212-b23c1f7c07ae","2023-12-25T11:43:27.079+00:00","2024-10-08T01:30:01.355+00:00",[],"School-of-Engineering-Science-Simon-Fraser-University-Burnaby-British-Columbia-Canada-V5A-1S6",{"title":1169},{"VI":1170},"School of Engineering Science, Simon Fraser University, Burnaby, British Columbia, Canada V5A 1S6",{"openalex":1172,"title":1174},{"VOID":1173},"A5054716984",{"EN":1175},"Tad McGeer",{"url":26,"publisher":1177,"properties":1202},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1178,"slug":663,"properties":1179,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1185,"manageAffiliations":1186,"indexDatabases":1187,"url":789,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":1180,"issn":1181,"introduce":1182,"eissn":1183,"title":1184},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[1188,1195],{"id":771,"indexDatabase":1189,"url":786,"indexYears":26,"academicFieldIds":1194,"indexDatabaseRanking":26},{"id":773,"createTime":774,"updateTime":775,"relativeEntities":1190,"label":1191,"description":1192,"key":782,"publicationTags":1193,"standard":26},[],{"EN":778,"VI":778},{"VI":780,"EN":781},[784,785],[788],{"id":747,"indexDatabase":1196,"url":760,"indexYears":761,"academicFieldIds":1201,"indexDatabaseRanking":769},{"id":749,"createTime":750,"updateTime":751,"relativeEntities":1197,"label":1198,"description":1199,"key":757,"publicationTags":1200,"standard":26},[],{"EN":754,"VI":754},{"EN":754,"VI":756},[759],[763,764,765,766,767,768],{"volume":1203,"pages":1205,"issue":1207},{"VOID":1204},"9",{"VOID":1206},"62-82",{"VOID":1208},"2",3256,{"total":1209,"publishYear":26,"statisticByYear":1211},{"2012":1212,"2013":1213,"2014":1078,"2015":121,"2016":1214,"2017":1215,"2018":1215,"2019":127,"2020":361,"2021":361,"2022":434,"2023":251,"2024":281},202,175,134,122,"1990-04-01",1990,[1219,1222,1225,1228,1231,1234,1237,1240,1243,1246,1249,1252,1255,1258,1261,1264,1267],{"id":26,"text":1220,"url":26,"identifiers":1221},"Lee, T-T., Proc. 1988 IEEE Int. Conf. Robot. Automat",{},{"id":26,"text":1223,"url":26,"identifiers":1224},"Margaria, R., 1976, Biomechanics and Energetics of Muscular Exercise. Oxford, U.K",{},{"id":26,"text":1226,"url":26,"identifiers":1227},"McGeer, T., 1988, Stability and control of two-dimensional biped walking. Technical report CSS-IS TR 88-01",{},{"id":26,"text":1229,"url":26,"identifiers":1230},"McGeer, T., 1989, Passive bipedal running. Technical report CSS-IS TR 89-02",{},{"id":26,"text":1232,"url":26,"identifiers":1233},"10.1177\u002F027836498400300202",{"doi":1232},{"id":26,"text":1235,"url":26,"identifiers":1236},"10.1080\u002F00207178408933260",{"doi":1235},{"id":26,"text":1238,"url":26,"identifiers":1239},"10.1177\u002F027836498400300206",{"doi":1238},{"id":26,"text":1241,"url":26,"identifiers":1242},"10.1016\u002F0025-5564(80)90070-X",{"doi":1241},{"id":26,"text":1244,"url":26,"identifiers":1245},"10.1109\u002FMEX.1986.4307016",{"doi":1244},{"id":26,"text":1247,"url":26,"identifiers":1248},"Russell, M., 1983, Robot. Age, 5, 12",{},{"id":26,"text":1250,"url":26,"identifiers":1251},"Takanishi, A., Proc. Int. Conf. Adv. Robot",{},{"id":26,"text":1253,"url":26,"identifiers":1254},"Thompson, C., Int. Symposium of Experimental Robotics",{},{"id":26,"text":1256,"url":26,"identifiers":1257},"10.1016\u002F0021-9290(85)90042-9",{"doi":1256},{"id":26,"text":1259,"url":26,"identifiers":1260},"10.1177\u002F027836498400300204",{"doi":1259},{"id":26,"text":1262,"url":26,"identifiers":1263},"10.1109\u002FJRA.1986.1087060",{"doi":1262},{"id":26,"text":1265,"url":26,"identifiers":1266},"Yamada, M., Proc. Int. Conf. Adv. Robot",{},{"id":26,"text":1268,"url":26,"identifiers":1269},"Zheng, Y-F., Proc. 1988 IEEE Int. Conf. Robot. Automat",{},{"id":1271,"createTime":1272,"updateTime":1273,"relativeEntities":1274,"slug":1275,"properties":1276,"entityType":815,"verifyStatus":25,"verifyTime":1290,"verifyNote":817,"syncStatus":28,"languages":1291,"translateLanguages":1292,"viewCount":36,"primaryUrl":1293,"fullTextUrl":26,"authors":1294,"publicationType":899,"publisherRelationship":1378,"citationCount":1409,"citationInfo":1410,"publishDate":945,"publishYear":946,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1419,"isForceReanalyzing":984},"01cd069b-aef2-438f-a8fd-df75809e585e","2024-09-28T21:09:02.674+00:00","2024-12-28T15:01:52.453+00:00",[],"Reinforcement-learning-in-robotics-A-survey",{"mag":1277,"keywords":1279,"openalex":1280,"abstract":1282,"title":1285,"doi":1288},{"VOID":1278},"1977655452",{"VI":995},{"VOID":1281},"W1977655452",{"EN":1283,"VI":1284},"\u003Cjats:p> Reinforcement learning offers to robotics a framework and set of tools for the design of sophisticated and hard-to-engineer behaviors. Conversely, the challenges of robotic problems provide both inspiration, impact, and validation for developments in reinforcement learning. The relationship between disciplines has sufficient promise to be likened to that between physics and mathematics. In this article, we attempt to strengthen the links between the two research communities by providing a survey of work in reinforcement learning for behavior generation in robots. We highlight both key challenges in robot reinforcement learning as well as notable successes. We discuss how contributions tamed the complexity of the domain and study the role of algorithms, representations, and prior knowledge in achieving these successes. As a result, a particular focus of our paper lies on the choice between model-based and model-free as well as between value-function-based and policy-search methods. By analyzing a simple problem in some detail we demonstrate how reinforcement learning approaches may be profitably applied, and we note throughout open questions and the tremendous potential for future research. \u003C\u002Fjats:p>","\u003Cjats:p> Học tăng cường cung cấp cho robot một khuôn khổ và bộ công cụ cho việc thiết kế những hành vi phức tạp và khó chế tạo. Ngược lại, những thách thức trong các vấn đề robot cung cấp cả nguồn cảm hứng, tác động và xác thực cho các phát triển trong học tăng cường. Mối quan hệ giữa các lĩnh vực này có đủ hứa hẹn để được so sánh với mối quan hệ giữa vật lý và toán học. Trong bài viết này, chúng tôi cố gắng củng cố các liên hệ giữa hai cộng đồng nghiên cứu bằng cách cung cấp một khảo sát về công trình nghiên cứu trong học tăng cường cho việc tạo ra hành vi ở robot. Chúng tôi nhấn mạnh cả những thách thức chính trong học tăng cường cho robot cũng như những thành công đáng chú ý. Chúng tôi thảo luận về cách các đóng góp đã kiểm soát độ phức tạp của lĩnh vực này và nghiên cứu vai trò của các thuật toán, các biểu diễn, và kiến thức trước đó trong việc đạt được những thành công này. Do đó, một trọng tâm cụ thể của bài báo của chúng tôi nằm ở sự lựa chọn giữa phương pháp dựa trên mô hình và không dựa trên mô hình, cũng như giữa phương pháp dựa trên giá trị và tìm kiếm chính sách. Bằng cách phân tích một vấn đề đơn giản trong một số chi tiết, chúng tôi chứng minh cách mà các phương pháp học tăng cường có thể được áp dụng một cách có lợi, và chúng tôi lưu ý rằng trong suốt bài viết có nhiều câu hỏi còn mở và tiềm năng to lớn cho nghiên cứu trong tương lai. \u003C\u002Fjats:p>",{"EN":1286,"VI":1287},"Reinforcement learning in robotics: A survey","Học tăng cường trong robot: Một khảo sát",{"VOID":1289},"10.1177\u002F0278364913495721","2024-09-28T21:09:02.673+00:00",[102],[101],"https:\u002F\u002Fjournals.sagepub.com\u002Fdoi\u002F10.1177\u002F0278364913495721",[1295,1327,1358],{"id":1296,"sortIndex":36,"researcher":26,"roles":1297,"affiliations":1298,"properties":1320},"98c99d18-6f4e-4649-834a-376a088e2652",[],[1299,1310],{"id":1300,"sortIndex":115,"affiliation":1301,"properties":26},"33bdaa72-deee-402a-aeef-98a46c92f74f",{"id":1302,"createTime":1303,"updateTime":1304,"relativeEntities":1305,"slug":1306,"properties":1307,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"89eb56d2-4500-4484-8f6f-b60f92571132","2024-02-07T12:50:18.768+00:00","2024-09-28T21:09:02.701+00:00",[],"Honda-Research-Institute-Europe-Offenbach-Main-Germany",{"title":1308},{"VI":1309},"Honda Research Institute Europe, Offenbach\u002FMain, Germany",{"id":1311,"sortIndex":36,"affiliation":1312,"properties":26},"5a9584bb-4203-4e37-a66f-b6e1d168508b",{"id":1313,"createTime":1314,"updateTime":1314,"relativeEntities":1315,"slug":1316,"properties":1317,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"83f816d3-3ead-424a-8002-463cc4e4fb21","2024-09-28T21:09:02.697+00:00",[],"Bielefeld-University-CoR-Lab-Research-Institute-for-Cognition-and-Robotics-Bielefeld-Germany",{"title":1318},{"EN":1319},"Bielefeld University, CoR-Lab Research Institute for Cognition and Robotics, Bielefeld, Germany",{"openalex":1321,"orcid":1323,"title":1325},{"VOID":1322},"A5035229829",{"VOID":1324},"https:\u002F\u002Forcid.org\u002F0000-0001-7257-5434",{"EN":1326},"Jens Kober",{"id":1328,"sortIndex":114,"researcher":26,"roles":1329,"affiliations":1330,"properties":1351},"601714c3-ab48-4ad9-9260-76ffa3c9dd6c",[],[1331,1341],{"id":1332,"sortIndex":36,"affiliation":1333,"properties":26},"fcbe7f01-4e04-4913-b7be-a04ac440dc44",{"id":1334,"createTime":1335,"updateTime":1335,"relativeEntities":1336,"slug":1337,"properties":1338,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"28cab763-fcb4-41de-a015-f6d2651b38bf","2024-09-28T21:09:02.721+00:00",[],"Max-Planck-Institute-for-Intelligent-Systems-Department-of-Empirical-Inference-T%C3%BCbingen-Germany",{"title":1339},{"EN":1340},"Max Planck Institute for Intelligent Systems, Department of Empirical Inference, Tübingen, Germany",{"id":1342,"sortIndex":115,"affiliation":1343,"properties":26},"44400315-c899-4efd-b38c-a996bfce792c",{"id":1344,"createTime":1345,"updateTime":1345,"relativeEntities":1346,"slug":1347,"properties":1348,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"df494b20-d8a5-469e-8783-13bfaae79433","2024-09-28T21:09:02.728+00:00",[],"Technische-Universit%C3%A4t-Darmstadt-FB-Informatik-FG-Intelligent-Autonomous-Systems-Darmstadt-Germany",{"title":1349},{"EN":1350},"Technische Universität Darmstadt, FB Informatik, FG Intelligent Autonomous Systems, Darmstadt, Germany",{"openalex":1352,"orcid":1354,"title":1356},{"VOID":1353},"A5071367253",{"VOID":1355},"https:\u002F\u002Forcid.org\u002F0000-0002-5266-8091",{"EN":1357},"Jan Peters",{"id":1359,"sortIndex":115,"researcher":26,"roles":1360,"affiliations":1361,"properties":1373},"366a5754-dfae-457b-b935-01258d6b4aaa",[],[1362],{"id":1363,"sortIndex":36,"affiliation":1364,"properties":26},"66058642-d348-4ae6-8457-ff6899665678",{"id":1365,"createTime":1366,"updateTime":1367,"relativeEntities":1368,"slug":1369,"properties":1370,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"0a418e8f-a358-47d6-8113-c6e59cb86d89","2023-12-06T23:23:00.416+00:00","2025-06-11T23:10:17.427+00:00",[],"Carnegie-Mellon-University-Robotics-Institute-Pittsburgh-PA-USA",{"title":1371},{"VI":1372},"Carnegie Mellon University, Robotics Institute, Pittsburgh, PA, USA",{"openalex":1374,"title":1376},{"VOID":1375},"A5034064327",{"EN":1377},"J. Andrew Bagnell",{"url":26,"publisher":1379,"properties":1404},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1380,"slug":663,"properties":1381,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1387,"manageAffiliations":1388,"indexDatabases":1389,"url":789,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":1382,"issn":1383,"introduce":1384,"eissn":1385,"title":1386},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[1390,1397],{"id":771,"indexDatabase":1391,"url":786,"indexYears":26,"academicFieldIds":1396,"indexDatabaseRanking":26},{"id":773,"createTime":774,"updateTime":775,"relativeEntities":1392,"label":1393,"description":1394,"key":782,"publicationTags":1395,"standard":26},[],{"EN":778,"VI":778},{"VI":780,"EN":781},[784,785],[788],{"id":747,"indexDatabase":1398,"url":760,"indexYears":761,"academicFieldIds":1403,"indexDatabaseRanking":769},{"id":749,"createTime":750,"updateTime":751,"relativeEntities":1399,"label":1400,"description":1401,"key":757,"publicationTags":1402,"standard":26},[],{"EN":754,"VI":754},{"EN":754,"VI":756},[759],[763,764,765,766,767,768],{"volume":1405,"pages":1406,"issue":1408},{"VOID":928},{"VOID":1407},"1238-1274",{"VOID":932},2522,{"total":1409,"publishYear":26,"statisticByYear":1411},{"2013":298,"2014":539,"2015":1412,"2016":627,"2017":1413,"2018":150,"2019":1414,"2020":1415,"2021":1416,"2022":118,"2023":1417,"2024":1418},75,166,306,367,466,285,172,[1420,1424,1427,1430,1433,1436,1439,1442,1445,1448,1451,1454,1457,1460,1463,1466,1469,1472,1475,1478,1481,1484,1487,1490,1493,1496,1499,1502,1506,1509,1512,1515,1518,1521,1524,1527,1530,1533,1536,1539,1542,1545,1548,1551,1554,1557,1561,1564,1567,1570,1573,1576,1579,1582,1585,1588,1591,1594,1597,1600,1603,1606,1609,1612,1615,1618,1621,1624,1627,1630,1633,1636,1639,1642,1645,1648,1652,1655,1658,1661,1664,1667,1670,1673,1676,1679,1682,1686,1689,1692,1695,1698,1701,1704,1707,1710,1714,1718,1721,1724,1727,1730,1733,1737,1740,1743,1746,1749,1751,1754,1757,1761,1764,1767,1770,1773,1776,1779,1782,1785,1788,1791,1794,1797,1800,1803,1806,1809,1812,1815,1818,1821,1824,1828,1831,1834,1837,1840,1843,1846,1849,1852,1856,1859,1862,1865,1869,1872,1875,1878,1881,1884,1887,1890,1893,1896,1899,1902,1906,1909,1912,1915,1919,1922,1925,1928,1931,1934,1937,1940,1943,1946,1949,1952,1955,1958,1961,1964,1967,1970,1973,1976,1980,1983,1986,1989,1992,1995,1998,2001,2004,2007,2010,2013,2016,2019,2022,2025,2028,2031,2034,2037,2040,2043,2046,2049,2052,2055,2058,2061,2064,2067,2070,2073,2076,2079,2082,2085,2088,2091,2094,2097,2100,2103],{"id":26,"text":1421,"url":26,"identifiers":1422},"Abbeel P, Coates A, Quigley M, Ng AY (2007) An application of reinforcement learning to aerobatic helicopter flight. In: Advances in Neural Information Processing Systems (NIPS).",{"doi":1423},"10.7551\u002Fmitpress\u002F7503.003.0006",{"id":26,"text":1425,"url":26,"identifiers":1426},"10.1145\u002F1015330.1015430",{"doi":1425},{"id":26,"text":1428,"url":26,"identifiers":1429},"10.1145\u002F1143844.1143845",{"doi":1428},{"id":26,"text":1431,"url":26,"identifiers":1432},"An CH, 1988, Model-based control of a robot manipulator",{},{"id":26,"text":1434,"url":26,"identifiers":1435},"10.1109\u002FIROS.2008.4651020",{"doi":1434},{"id":26,"text":1437,"url":26,"identifiers":1438},"10.1016\u002Fj.robot.2008.10.024",{"doi":1437},{"id":26,"text":1440,"url":26,"identifiers":1441},"10.1002\u002Frob.4620010203",{"doi":1440},{"id":26,"text":1443,"url":26,"identifiers":1444},"10.1007\u002FBF00117447",{"doi":1443},{"id":26,"text":1446,"url":26,"identifiers":1447},"Åström KJ, 1989, Adaptive Control",{},{"id":26,"text":1449,"url":26,"identifiers":1450},"Atkeson CG, 1994, Advances in Neural Information Processing Systems (NIPS)",{},{"id":26,"text":1452,"url":26,"identifiers":1453},"Atkeson CG, 1998, Advances in Neural Information Processing Systems (NIPS)",{},{"id":26,"text":1455,"url":26,"identifiers":1456},"Atkeson CG, 1997, AI Review, 11, 75",{},{"id":26,"text":1458,"url":26,"identifiers":1459},"Atkeson CG, 1997, International Conference on Machine Learning (ICML)",{},{"id":26,"text":1461,"url":26,"identifiers":1462},"Bagnell JA, 2004, Learning Decisions: Robustness, Uncertainty, and Approximation",{},{"id":26,"text":1464,"url":26,"identifiers":1465},"Bagnell JA, 2003, Advances in Neural Information Processing Systems (NIPS)",{},{"id":26,"text":1467,"url":26,"identifiers":1468},"Bagnell JA, 2003, International Joint Conference on Artifical Intelligence (IJCAI)",{},{"id":26,"text":1470,"url":26,"identifiers":1471},"10.1109\u002FROBOT.2001.932842",{"doi":1470},{"id":26,"text":1473,"url":26,"identifiers":1474},"10.21236\u002FADA280844",{"doi":1473},{"id":26,"text":1476,"url":26,"identifiers":1477},"Bakker B, 2003, IEEE\u002FRSJ International Conference on Intelligent Robots and Systems (IROS)",{},{"id":26,"text":1479,"url":26,"identifiers":1480},"10.1109\u002FROBOT.2006.1642157",{"doi":1479},{"id":26,"text":1482,"url":26,"identifiers":1483},"10.1023\u002FA:1025696116075",{"doi":1482},{"id":26,"text":1485,"url":26,"identifiers":1486},"Bellman RE, 1957, Dynamic Programming",{},{"id":26,"text":1488,"url":26,"identifiers":1489},"Bellman RE, 1967, Introduction to the Mathematical Theory of Control Processes",{},{"id":26,"text":1491,"url":26,"identifiers":1492},"Bellman RE, 1971, Introduction to the Mathematical Theory of Control Processes",{},{"id":26,"text":1494,"url":26,"identifiers":1495},"10.1109\u002FIJCNN.1992.287219",{"doi":1494},{"id":26,"text":1497,"url":26,"identifiers":1498},"10.1016\u002FS0921-8890(97)00043-2",{"doi":1497},{"id":26,"text":1500,"url":26,"identifiers":1501},"Bentivegna DC, 2004, Learning from Observation Using Primitives",{},{"id":26,"text":1503,"url":26,"identifiers":1504},"Bentivegna DC, 2004, Robotics Research, 15, 551, 10.1007\u002F11008941_59",{"doi":1505},"10.1007\u002F11008941_59",{"id":26,"text":1507,"url":26,"identifiers":1508},"Bertsekas DP, 1995, Dynamic Programming and Optimal Control",{},{"id":26,"text":1510,"url":26,"identifiers":1511},"Betts JT, 2001, Practical methods for optimal control using nonlinear programming, 3",{},{"id":26,"text":1513,"url":26,"identifiers":1514},"Birdwell N, 2007, Reinforcement learning in sensor-guided AIBO robots",{},{"id":26,"text":1516,"url":26,"identifiers":1517},"Bishop C, 2006, Pattern Recognition and Machine Learning",{},{"id":26,"text":1519,"url":26,"identifiers":1520},"10.1109\u002FIROS.2010.5650243",{"doi":1519},{"id":26,"text":1522,"url":26,"identifiers":1523},"Boyan JA, 1995, Advances in Neural Information Processing Systems (NIPS)",{},{"id":26,"text":1525,"url":26,"identifiers":1526},"Brafman RI, 2002, Journal of Machine Learning Research, 3, 213",{},{"id":26,"text":1528,"url":26,"identifiers":1529},"10.1177\u002F0278364911402527",{"doi":1528},{"id":26,"text":1531,"url":26,"identifiers":1532},"10.1109\u002FTCST.2005.847335",{"doi":1531},{"id":26,"text":1534,"url":26,"identifiers":1535},"10.1201\u002F9781439821091",{"doi":1534},{"id":26,"text":1537,"url":26,"identifiers":1538},"10.1145\u002F1538788.1538812",{"doi":1537},{"id":26,"text":1540,"url":26,"identifiers":1541},"10.1109\u002FIROS.2006.282061",{"doi":1540},{"id":26,"text":1543,"url":26,"identifiers":1544},"10.1109\u002FCIRA.2007.382878",{"doi":1543},{"id":26,"text":1546,"url":26,"identifiers":1547},"10.1109\u002FIROS.2012.6386047",{"doi":1546},{"id":26,"text":1549,"url":26,"identifiers":1550},"10.1007\u002Fs10994-009-5106-x",{"doi":1549},{"id":26,"text":1552,"url":26,"identifiers":1553},"10.1162\u002Fneco.1997.9.2.271",{"doi":1552},{"id":26,"text":1555,"url":26,"identifiers":1556},"Deisenroth MP, 2011, 28th International Conference on Machine Learning (ICML)",{},{"id":26,"text":1558,"url":26,"identifiers":1559},"Deisenroth MP, Rasmussen CE, Fox D (2011) Learning to control a low-cost manipulator using data-efficient reinforcement learning. In:s Robotics: Science and Systems (RSS).",{"doi":1560},"10.15607\u002FRSS.2011.VII.008",{"id":26,"text":1562,"url":26,"identifiers":1563},"10.1109\u002F3477.499790",{"doi":1562},{"id":26,"text":1565,"url":26,"identifiers":1566},"Donoho DL, 2000, American Mathematical Society Conference Math Challenges of the 21st Century",{},{"id":26,"text":1568,"url":26,"identifiers":1569},"Dorigo M, 1993, International Computer Science Institute",{},{"id":26,"text":1571,"url":26,"identifiers":1572},"Duan Y, Cui B, Yang H (2008) Robot navigation based on fuzzy RL algorithm. In: International Symposium on Neural Networks (ISNN).",{},{"id":26,"text":1574,"url":26,"identifiers":1575},"10.1016\u002Fj.engappai.2007.01.003",{"doi":1574},{"id":26,"text":1577,"url":26,"identifiers":1578},"10.1177\u002F0278364907084980",{"doi":1577},{"id":26,"text":1580,"url":26,"identifiers":1581},"10.1016\u002Fj.robot.2007.08.001",{"doi":1580},{"id":26,"text":1583,"url":26,"identifiers":1584},"Fagg AH, Lotspeich DL, Hoff J, Bekey GA (1998) Rapid reinforcement learning for reactive control policy design for autonomous robots. In: Artificial Life in Robotics.",{},{"id":26,"text":1586,"url":26,"identifiers":1587},"Fidelman P, Stone P (2004) Learning ball acquisition on a physical robot. In: International Symposium on Robotics and Automation (ISRA).",{},{"id":26,"text":1589,"url":26,"identifiers":1590},"10.1177\u002F0142331209104155",{"doi":1589},{"id":26,"text":1592,"url":26,"identifiers":1593},"10.1109\u002FIROS.2000.894638",{"doi":1592},{"id":26,"text":1595,"url":26,"identifiers":1596},"Geng T, 2006, Advances in Neural Information Processing Systems (NIPS)",{},{"id":26,"text":1598,"url":26,"identifiers":1599},"10.21236\u002FADA197085",{"doi":1598},{"id":26,"text":1601,"url":26,"identifiers":1602},"Goldberg DE, 1989, Genetic algorithms",{},{"id":26,"text":1604,"url":26,"identifiers":1605},"Gordon GJ, 1999, School of Computer Science, Carnegie Mellon University",{},{"id":26,"text":1607,"url":26,"identifiers":1608},"Gräve K, 2010, Joint International Symposium on Robotics (ISR) and German Conference on Robotics (ROBOTIK)",{},{"id":26,"text":1610,"url":26,"identifiers":1611},"Greensmith E, 2004, Journal of Machine Learning Research, 5, 1471",{},{"id":26,"text":1613,"url":26,"identifiers":1614},"10.1163\u002F156855307782148550",{"doi":1613},{"id":26,"text":1616,"url":26,"identifiers":1617},"10.1109\u002F37.257890",{"doi":1616},{"id":26,"text":1619,"url":26,"identifiers":1620},"Hafner R, 2003, IEEE\u002FRSJ International Conference on Intelligent Robots and Systems (IROS)",{},{"id":26,"text":1622,"url":26,"identifiers":1623},"10.1109\u002FROBOT.2007.363631",{"doi":1622},{"id":26,"text":1625,"url":26,"identifiers":1626},"10.1109\u002FICSMC.1998.728096",{"doi":1625},{"id":26,"text":1628,"url":26,"identifiers":1629},"10.1109\u002FTAMD.2010.2103311",{"doi":1628},{"id":26,"text":1631,"url":26,"identifiers":1632},"10.1109\u002FROBOT.2010.5509181",{"doi":1631},{"id":26,"text":1634,"url":26,"identifiers":1635},"10.1109\u002FICRA.2012.6225072",{"doi":1634},{"id":26,"text":1637,"url":26,"identifiers":1638},"Huang X, Weng J (2002) Novelty and reinforcement learning in the value system of developmental robots. In: 2nd International Workshop on Epigenetic Robotics: Modeling Cognitive Development in Robotic Systems.",{},{"id":26,"text":1640,"url":26,"identifiers":1641},"10.1016\u002FS0921-8890(97)00044-4",{"doi":1640},{"id":26,"text":1643,"url":26,"identifiers":1644},"Ijspeert AJ, 2003, Advances in Neural Information Processing Systems (NIPS)",{},{"id":26,"text":1646,"url":26,"identifiers":1647},"10.1109\u002FROBOT.1999.770457",{"doi":1646},{"id":26,"text":1649,"url":26,"identifiers":1650},"Jaakkola T, Jordan MI, Singh SP (1993) Convergence of stochastic iterative dynamic programming algorithms. In: Advances in Neural Information Processing Systems (NIPS).",{"doi":1651},"10.21236\u002FADA276517",{"id":26,"text":1653,"url":26,"identifiers":1654},"Jacobson DH, 1970, Differential Dynamic Programming",{},{"id":26,"text":1656,"url":26,"identifiers":1657},"10.1007\u002F3-540-59496-5_337",{"doi":1656},{"id":26,"text":1659,"url":26,"identifiers":1660},"Kaelbling LP, 1990, Stanford University, Stanford",{},{"id":26,"text":1662,"url":26,"identifiers":1663},"10.1613\u002Fjair.301",{"doi":1662},{"id":26,"text":1665,"url":26,"identifiers":1666},"Kakade S, 2003, On the Sample Complexity of Reinforcement Learning",{},{"id":26,"text":1668,"url":26,"identifiers":1669},"Kakade S, 2002, International Conference on Machine Learning (ICML)",{},{"id":26,"text":1671,"url":26,"identifiers":1672},"10.1109\u002FIROS.2011.6095096",{"doi":1671},{"id":26,"text":1674,"url":26,"identifiers":1675},"10.1115\u002F1.3653115",{"doi":1674},{"id":26,"text":1677,"url":26,"identifiers":1678},"10.1007\u002F3-540-49240-2_3",{"doi":1677},{"id":26,"text":1680,"url":26,"identifiers":1681},"10.1088\u002F1742-5468\u002F2005\u002F11\u002FP11011",{"doi":1680},{"id":26,"text":1683,"url":26,"identifiers":1684},"Katz D, Pyuro Y, Brock O (2008) Learning to manipulate articulated objects in unstructured environments using a grounded relational representation. In: Robotics: Science and Systems (RSS).",{"doi":1685},"10.15607\u002FRSS.2008.IV.033",{"id":26,"text":1687,"url":26,"identifiers":1688},"Kawato M, 1990, Advanced Neural Computers, 6, 365",{},{"id":26,"text":1690,"url":26,"identifiers":1691},"10.1023\u002FA:1017984413808",{"doi":1690},{"id":26,"text":1693,"url":26,"identifiers":1694},"Keeney R, 1976, Decisions with multiple objectives: Preferences and value tradeoffs",{},{"id":26,"text":1696,"url":26,"identifiers":1697},"10.1109\u002FCDC.2001.980135",{"doi":1696},{"id":26,"text":1699,"url":26,"identifiers":1700},"Kirchner F (1997) Q-learning of complex behaviours on a six-legged walking machine. In: EUROMICRO Workshop on Advanced Mobile Robots.",{},{"id":26,"text":1702,"url":26,"identifiers":1703},"Kirk DE, 1970, Optimal control theory",{},{"id":26,"text":1705,"url":26,"identifiers":1706},"10.1109\u002FROBOT.2007.363075",{"doi":1705},{"id":26,"text":1708,"url":26,"identifiers":1709},"10.1109\u002FIROS.2008.4650953",{"doi":1708},{"id":26,"text":1711,"url":26,"identifiers":1712},"Kober J, Oztop E, Peters J (2010) Reinforcement learning to adjust robot movements to new situations. In: Robotics: Science and Systems (RSS).",{"doi":1713},"10.15607\u002FRSS.2010.VI.005",{"id":26,"text":1715,"url":26,"identifiers":1716},"Kober J, Peters J (2009) Policy search for motor primitives in robotics. In: Advances in Neural Information Processing Systems (NIPS).",{"doi":1717},"10.1109\u002FROBOT.2009.5152577",{"id":26,"text":1719,"url":26,"identifiers":1720},"Kober J, 2010, Machine Learning, 84, 171",{},{"id":26,"text":1722,"url":26,"identifiers":1723},"10.1109\u002FROBOT.2004.1307456",{"doi":1722},{"id":26,"text":1725,"url":26,"identifiers":1726},"10.1177\u002F0278364907087426",{"doi":1725},{"id":26,"text":1728,"url":26,"identifiers":1729},"Kolter JZ, Abbeel P, Ng AY (2007) Hierarchical apprenticeship learning with application to quadruped locomotion. In: Advances in Neural Information Processing Systems (NIPS).",{},{"id":26,"text":1731,"url":26,"identifiers":1732},"10.1145\u002F1390156.1390218",{"doi":1731},{"id":26,"text":1734,"url":26,"identifiers":1735},"Kolter JZ, Ng AY (2009a) Policy search via the signed derivative. In: Robotics: Science and Systems (RSS).",{"doi":1736},"10.7551\u002Fmitpress\u002F8727.003.0028",{"id":26,"text":1738,"url":26,"identifiers":1739},"10.1145\u002F1553374.1553442",{"doi":1738},{"id":26,"text":1741,"url":26,"identifiers":1742},"10.1109\u002FROBOT.2010.5509562",{"doi":1741},{"id":26,"text":1744,"url":26,"identifiers":1745},"Konidaris GD, 2011, AAAI Conference on Artificial Intelligence (AAAI)",{},{"id":26,"text":1747,"url":26,"identifiers":1748},"10.1177\u002F0278364911428653",{"doi":1747},{"id":26,"text":1744,"url":26,"identifiers":1750},{},{"id":26,"text":1752,"url":26,"identifiers":1753},"10.1109\u002FIROS.2009.5354345",{"doi":1752},{"id":26,"text":1755,"url":26,"identifiers":1756},"10.1016\u002Fj.robot.2010.06.001",{"doi":1755},{"id":26,"text":1758,"url":26,"identifiers":1759},"Kuhn HW, Tucker AW (1950) Nonlinear programming. In: Berkeley Symposium on Mathematical Statistics and Probability.",{"doi":1760},"10.1525\u002F9780520411586-036",{"id":26,"text":1762,"url":26,"identifiers":1763},"10.1109\u002FHumanoids.2011.6100881",{"doi":1762},{"id":26,"text":1765,"url":26,"identifiers":1766},"10.1109\u002FIROS.2004.1389903",{"doi":1765},{"id":26,"text":1768,"url":26,"identifiers":1769},"10.1145\u002F1102351.1102411",{"doi":1768},{"id":26,"text":1771,"url":26,"identifiers":1772},"10.1007\u002F978-3-540-74024-7_5",{"doi":1771},{"id":26,"text":1774,"url":26,"identifiers":1775},"Laud AD, 2004, University of Illinois at Urbana-Champaign",{},{"id":26,"text":1777,"url":26,"identifiers":1778},"Lewis ME, 2001, The Handbook of Markov Decision Processes: Methods and Applications, 89",{},{"id":26,"text":1780,"url":26,"identifiers":1781},"10.1109\u002FIROS.2012.6385878",{"doi":1780},{"id":26,"text":1783,"url":26,"identifiers":1784},"Lizotte D, 2007, International Joint Conference on Artifical Intelligence (IJCAI)",{},{"id":26,"text":1786,"url":26,"identifiers":1787},"10.1016\u002F0004-3702(92)90058-6",{"doi":1786},{"id":26,"text":1789,"url":26,"identifiers":1790},"10.1109\u002FROBOT.2005.1570760",{"doi":1789},{"id":26,"text":1792,"url":26,"identifiers":1793},"10.1016\u002FB978-1-55860-335-6.50030-1",{"doi":1792},{"id":26,"text":1795,"url":26,"identifiers":1796},"10.1023\u002FA:1008819414322",{"doi":1795},{"id":26,"text":1798,"url":26,"identifiers":1799},"10.1145\u002F1102351.1102426",{"doi":1798},{"id":26,"text":1801,"url":26,"identifiers":1802},"10.1109\u002FIROS.2005.1545206",{"doi":1801},{"id":26,"text":1804,"url":26,"identifiers":1805},"10.1016\u002FS0893-6080(96)00043-3",{"doi":1804},{"id":26,"text":1807,"url":26,"identifiers":1808},"Moldovan TM, 2012, 29th International Conference on Machine Learning (ICML), 1711",{},{"id":26,"text":1810,"url":26,"identifiers":1811},"10.1007\u002FBF00993104",{"doi":1810},{"id":26,"text":1813,"url":26,"identifiers":1814},"10.1016\u002FS0921-8890(01)00113-0",{"doi":1813},{"id":26,"text":1816,"url":26,"identifiers":1817},"Muelling K, 2012, The International Journal of Robotics Research",{},{"id":26,"text":1819,"url":26,"identifiers":1820},"10.1177\u002F0278364908091463",{"doi":1819},{"id":26,"text":1822,"url":26,"identifiers":1823},"10.1109\u002FICHR.2009.5379568",{"doi":1822},{"id":26,"text":1825,"url":26,"identifiers":1826},"Nemec B, Zorko M, Zlajpah L (2010) Learning of a ball in a cup playing robot. In: International Workshop on Robotics in Alpe-Adria-Danube Region (RAAD).",{"doi":1827},"10.1109\u002FRAAD.2010.5524570",{"id":26,"text":1829,"url":26,"identifiers":1830},"Ng AY, Coates A, Diel M, (2004a) Autonomous inverted helicopter flight via reinforcement learning. In: International Symposium on Experimental Robotics (ISER).",{},{"id":26,"text":1832,"url":26,"identifiers":1833},"Ng AY, 1999, International Conference on Machine Learning (ICML)",{},{"id":26,"text":1835,"url":26,"identifiers":1836},"Ng AY, Kim HJ, Jordan MI, Sastry S (2004b) Autonomous helicopter flight via reinforcement learning. In: Advances in Neural Information Processing Systems (NIPS).",{},{"id":26,"text":1838,"url":26,"identifiers":1839},"10.1109\u002FTRA.2002.999653",{"doi":1838},{"id":26,"text":1841,"url":26,"identifiers":1842},"10.1109\u002FROBOT.2010.5509420",{"doi":1841},{"id":26,"text":1844,"url":26,"identifiers":1845},"10.1007\u002F978-3-540-74565-5_19",{"doi":1844},{"id":26,"text":1847,"url":26,"identifiers":1848},"Park DH, 2008, IEEE International Conference on Humanoid Robots (HUMANOIDS)",{},{"id":26,"text":1850,"url":26,"identifiers":1851},"10.1109\u002FICRA.2011.5980200",{"doi":1850},{"id":26,"text":1853,"url":26,"identifiers":1854},"Pendrith M (1999) Reinforcement learning in situated agents: Some theoretical problems and practical solutions. In: European Workshop on Learning Robots (EWRL).",{"doi":1855},"10.1007\u002F3-540-40044-3_6",{"id":26,"text":1857,"url":26,"identifiers":1858},"10.1007\u002FBF00114731",{"doi":1857},{"id":26,"text":1860,"url":26,"identifiers":1861},"Perkins TJ, 2002, Journal of Machine Learning Research, 3, 803",{},{"id":26,"text":1863,"url":26,"identifiers":1864},"Peters J, 2010, National Conference on Artificial Intelligence (AAAI)",{},{"id":26,"text":1866,"url":26,"identifiers":1867},"Peters J, Muelling K, Kober J, Nguyen-Tuong D, Kroemer O (2010b) Towards motor skill learning for robotics. In: International Symposium on Robotics Research (ISRR).",{"doi":1868},"10.1007\u002F978-3-642-19457-3_28",{"id":26,"text":1870,"url":26,"identifiers":1871},"10.1177\u002F0278364907087548",{"doi":1870},{"id":26,"text":1873,"url":26,"identifiers":1874},"10.1016\u002Fj.neucom.2007.11.026",{"doi":1873},{"id":26,"text":1876,"url":26,"identifiers":1877},"10.1016\u002Fj.neunet.2008.02.003",{"doi":1876},{"id":26,"text":1879,"url":26,"identifiers":1880},"Peters J, 2004, University of Southern California",{},{"id":26,"text":1882,"url":26,"identifiers":1883},"10.1177\u002F0278364910382464",{"doi":1882},{"id":26,"text":1885,"url":26,"identifiers":1886},"Platt R, 2006, International Conference on Development and Learning",{},{"id":26,"text":1888,"url":26,"identifiers":1889},"Powell WB, 2012, Princeton University",{},{"id":26,"text":1891,"url":26,"identifiers":1892},"10.1002\u002F9780470316887",{"doi":1891},{"id":26,"text":1894,"url":26,"identifiers":1895},"Randløv J, 1998, International Conference on Machine Learning (ICML), 463",{},{"id":26,"text":1897,"url":26,"identifiers":1898},"Rasmussen C, 2006, Gaussian Processes for Machine Learning",{},{"id":26,"text":1900,"url":26,"identifiers":1901},"10.21236\u002FADA528601",{"doi":1900},{"id":26,"text":1903,"url":26,"identifiers":1904},"Ratliff N, Bradley D, Bagnell JA, Chestnutt J (2006a) Boosting structured prediction for imitation learning. In: Advances in Neural Information Processing Systems (NIPS).",{"doi":1905},"10.7551\u002Fmitpress\u002F7503.003.0149",{"id":26,"text":1907,"url":26,"identifiers":1908},"10.1145\u002F1143844.1143936",{"doi":1907},{"id":26,"text":1910,"url":26,"identifiers":1911},"10.1007\u002Fs10514-009-9120-4",{"doi":1910},{"id":26,"text":1913,"url":26,"identifiers":1914},"Rivlin TJ, 1969, An Introduction to the Approximation of Functions",{},{"id":26,"text":1916,"url":26,"identifiers":1917},"Roberts JW, Manchester I, Tedrake R (2011) Feedback controller parameterizations for reinforcement learning. In: IEEE Symposium on Adaptive Dynamic Programming and Reinforcement Learning (ADPRL).",{"doi":1918},"10.1109\u002FADPRL.2011.5967370",{"id":26,"text":1920,"url":26,"identifiers":1921},"10.1007\u002F978-3-642-05181-4_13",{"doi":1920},{"id":26,"text":1923,"url":26,"identifiers":1924},"10.23919\u002FACC.2004.1384022",{"doi":1923},{"id":26,"text":1926,"url":26,"identifiers":1927},"Ross S, 2012, International Conference on Machine Learning (ICML)",{},{"id":26,"text":1929,"url":26,"identifiers":1930},"Ross S, 2011, International Conference on Artifical Intelligence and Statistics (AISTATS)",{},{"id":26,"text":1932,"url":26,"identifiers":1933},"10.1109\u002FCVPR.2011.5995724",{"doi":1932},{"id":26,"text":1935,"url":26,"identifiers":1936},"10.1109\u002FIROS.2007.4399531",{"doi":1935},{"id":26,"text":1938,"url":26,"identifiers":1939},"10.1007\u002F978-1-4757-4321-0",{"doi":1938},{"id":26,"text":1941,"url":26,"identifiers":1942},"Rückstieß T, 2008, European Conference on Machine Learning (ECML)",{},{"id":26,"text":1944,"url":26,"identifiers":1945},"10.1145\u002F279943.279964",{"doi":1944},{"id":26,"text":1947,"url":26,"identifiers":1948},"10.2307\u002F2171751",{"doi":1947},{"id":26,"text":1950,"url":26,"identifiers":1951},"10.1007\u002F3-540-46084-5_126",{"doi":1950},{"id":26,"text":1953,"url":26,"identifiers":1954},"Schaal S (1996) Learning from demonstration. In: Advances in Neural Information Processing Systems (NIPS).",{},{"id":26,"text":1956,"url":26,"identifiers":1957},"10.1016\u002FS1364-6613(99)01327-3",{"doi":1956},{"id":26,"text":1959,"url":26,"identifiers":1960},"Schaal S, 2009, University of Southern California",{},{"id":26,"text":1962,"url":26,"identifiers":1963},"10.1109\u002F37.257895",{"doi":1962},{"id":26,"text":1965,"url":26,"identifiers":1966},"10.1023\u002FA:1015727715131",{"doi":1965},{"id":26,"text":1968,"url":26,"identifiers":1969},"10.1016\u002FS0079-6123(06)65027-9",{"doi":1968},{"id":26,"text":1971,"url":26,"identifiers":1972},"Schneider JG (1996) Exploiting model uncertainty estimates for safe dynamic control learning. In: Advances in Neural Information Processing Systems (NIPS).",{},{"id":26,"text":1974,"url":26,"identifiers":1975},"10.1016\u002FB978-1-55860-307-3.50045-9",{"doi":1974},{"id":26,"text":1977,"url":26,"identifiers":1978},"Silver D, Bagnell JA, Stentz A (2008) High performance outdoor navigation from overhead data using imitation learning. In: Robotics: Science and Systems (RSS).",{"doi":1979},"10.15607\u002FRSS.2008.IV.034",{"id":26,"text":1981,"url":26,"identifiers":1982},"10.1177\u002F0278364910369715",{"doi":1981},{"id":26,"text":1984,"url":26,"identifiers":1985},"Smart WD, 1998, National Conference on Artificial Intelligence\u002FInnovative Applications of Artificial Intelligence (AAAI\u002FIAAI)",{},{"id":26,"text":1987,"url":26,"identifiers":1988},"10.1109\u002FROBOT.2002.1014237",{"doi":1987},{"id":26,"text":1990,"url":26,"identifiers":1991},"Soni V, 2006, International Conference on Development and Learning (ICDL)",{},{"id":26,"text":1993,"url":26,"identifiers":1994},"Sorg J, 2010, Advances in Neural Information Processing Systems (NIPS)",{},{"id":26,"text":1996,"url":26,"identifiers":1997},"10.1002\u002F0471722138",{"doi":1996},{"id":26,"text":1999,"url":26,"identifiers":2000},"Strens M, 2001, International Conference on Machine Learning (ICML)",{},{"id":26,"text":2002,"url":26,"identifiers":2003},"Stulp F, 2012, International Conference on Machine Learning (ICML)",{},{"id":26,"text":2005,"url":26,"identifiers":2006},"10.1109\u002FIROS.2011.6094877",{"doi":2005},{"id":26,"text":2008,"url":26,"identifiers":2009},"10.1016\u002FB978-1-55860-141-3.50030-4",{"doi":2008},{"id":26,"text":2011,"url":26,"identifiers":2012},"Sutton RS, 1998, Reinforcement Learning",{},{"id":26,"text":2014,"url":26,"identifiers":2015},"10.23919\u002FACC.1991.4791776",{"doi":2014},{"id":26,"text":2017,"url":26,"identifiers":2018},"10.1145\u002F1273496.1273606",{"doi":2017},{"id":26,"text":2020,"url":26,"identifiers":2021},"Sutton RS, 1999, Advances in Neural Information Processing Systems (NIPS)",{},{"id":26,"text":2023,"url":26,"identifiers":2024},"10.1016\u002FS0954-1810(01)00027-9",{"doi":2023},{"id":26,"text":2026,"url":26,"identifiers":2027},"Tadepalli P, 1994, H-learning: A Reinforcement Learning Method to Optimize Undiscounted Average Reward",{},{"id":26,"text":2029,"url":26,"identifiers":2030},"10.1007\u002F978-3-642-03040-6_125",{"doi":2029},{"id":26,"text":2032,"url":26,"identifiers":2033},"10.1016\u002Fj.robot.2011.07.004",{"doi":2032},{"id":26,"text":2035,"url":26,"identifiers":2036},"10.1109\u002FIROS.2004.1389841",{"doi":2035},{"id":26,"text":2038,"url":26,"identifiers":2039},"10.1177\u002F0278364910369189",{"doi":2038},{"id":26,"text":2041,"url":26,"identifiers":2042},"Tedrake R, 2005, Yale Workshop on Adaptive and Learning Systems",{},{"id":26,"text":2044,"url":26,"identifiers":2045},"10.1109\u002FIROS.2011.6095076",{"doi":2044},{"id":26,"text":2047,"url":26,"identifiers":2048},"10.1109\u002FROBOT.2010.5509336",{"doi":2047},{"id":26,"text":2050,"url":26,"identifiers":2051},"10.1016\u002F0921-8890(95)00022-8",{"doi":2050},{"id":26,"text":2053,"url":26,"identifiers":2054},"Tokic M, 2009, International Florida Artificial Intelligence Research Society Conference (FLAIRS)",{},{"id":26,"text":2056,"url":26,"identifiers":2057},"Toussaint M, 2010, Inference and Learning in Dynamic Models",{},{"id":26,"text":2059,"url":26,"identifiers":2060},"10.1016\u002FS0921-8890(97)00042-0",{"doi":2059},{"id":26,"text":2062,"url":26,"identifiers":2063},"10.1109\u002F9.580874",{"doi":2062},{"id":26,"text":2065,"url":26,"identifiers":2066},"10.1109\u002FROBOT.1998.677351",{"doi":2065},{"id":26,"text":2068,"url":26,"identifiers":2069},"10.1109\u002FROBOT.2010.5509621",{"doi":2068},{"id":26,"text":2071,"url":26,"identifiers":2072},"10.1007\u002Fs10514-009-9132-0",{"doi":2071},{"id":26,"text":2074,"url":26,"identifiers":2075},"10.1109\u002FRAMECH.2006.252749",{"doi":2074},{"id":26,"text":2077,"url":26,"identifiers":2078},"10.1109\u002FICHR.2010.5686339",{"doi":2077},{"id":26,"text":2080,"url":26,"identifiers":2081},"Wikipedia (2013) Fosbury Flop. http:\u002F\u002Fen.wikipedia.org\u002Fwiki\u002FFosbury_FlopFosbury_Flop.",{},{"id":26,"text":2083,"url":26,"identifiers":2084},"Willgoss RA, 1999, Australian Conference on Robotics and Automation",{},{"id":26,"text":2086,"url":26,"identifiers":2087},"10.1007\u002FBF00992696",{"doi":2086},{"id":26,"text":2089,"url":26,"identifiers":2090},"10.1109\u002FROBOT.1997.620036",{"doi":2089},{"id":26,"text":2092,"url":26,"identifiers":2093},"10.1007\u002F978-3-540-69134-1_25",{"doi":2092},{"id":26,"text":2095,"url":26,"identifiers":2096},"Youssef SM, 2005, ICGST International Conference on Automation, Robotics and Autonomous Systems (ARAS)",{},{"id":26,"text":2098,"url":26,"identifiers":2099},"Zhou K, 1997, Essentials of Robust Control",{},{"id":26,"text":2101,"url":26,"identifiers":2102},"Ziebart BD, 2008, AAAI Conference on Artificial Intelligence (AAAI)",{},{"id":26,"text":2104,"url":26,"identifiers":2105},"10.1109\u002FICRA.2012.6225036",{"doi":2104},{"id":2107,"createTime":2108,"updateTime":2108,"relativeEntities":2109,"slug":2110,"properties":2111,"entityType":815,"verifyStatus":25,"verifyTime":2108,"verifyNote":817,"syncStatus":28,"languages":2123,"translateLanguages":26,"viewCount":36,"primaryUrl":2124,"fullTextUrl":26,"authors":2125,"publicationType":899,"publisherRelationship":2212,"citationCount":2244,"citationInfo":2245,"publishDate":2252,"publishYear":2253,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2254,"isForceReanalyzing":984},"bb86bbed-0d19-4ff2-8330-690ae1253462","2024-09-21T02:19:00.228+00:00",[],"RGB-D-mapping-Using-Kinect-style-depth-cameras-for-dense-3D-modeling-of-indoor-environments",{"mag":2112,"keywords":2114,"openalex":2115,"abstract":2117,"title":2119,"doi":2121},{"VOID":2113},"1972671602",{},{"VOID":2116},"W1972671602",{"EN":2118},"\u003Cjats:p> RGB-D cameras (such as the Microsoft Kinect) are novel sensing systems that capture RGB images along with per-pixel depth information. In this paper we investigate how such cameras can be used for building dense 3D maps of indoor environments. Such maps have applications in robot navigation, manipulation, semantic mapping, and telepresence. We present RGB-D Mapping, a full 3D mapping system that utilizes a novel joint optimization algorithm combining visual features and shape-based alignment. Visual and depth information are also combined for view-based loop-closure detection, followed by pose optimization to achieve globally consistent maps. We evaluate RGB-D Mapping on two large indoor environments, and show that it effectively combines the visual and shape information available from RGB-D cameras. \u003C\u002Fjats:p>",{"EN":2120},"RGB-D mapping: Using Kinect-style depth cameras for dense 3D modeling of indoor environments",{"VOID":2122},"10.1177\u002F0278364911434148",[102],"https:\u002F\u002Fjournals.sagepub.com\u002Fdoi\u002F10.1177\u002F0278364911434148",[2126,2147,2167,2182,2197],{"id":2127,"sortIndex":59,"researcher":26,"roles":2128,"affiliations":2129,"properties":2140},"9db0c24e-dbef-448f-bd48-6b86d9742b51",[],[2130],{"id":2131,"sortIndex":36,"affiliation":2132,"properties":26},"4beb7967-694b-4fd5-ab77-2e45b765b8d6",{"id":2133,"createTime":2134,"updateTime":2134,"relativeEntities":2135,"slug":2136,"properties":2137,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"373a164f-13fc-4c66-a0d1-b27195bd34ab","2024-09-21T02:19:00.249+00:00",[],"ISTC-Pervasive-Computing-Intel-Labs-Seattle-WA-USA-TAB-",{"title":2138},{"EN":2139},"ISTC-Pervasive Computing, Intel Labs, Seattle, WA, USA#TAB#",{"openalex":2141,"orcid":2143,"title":2145},{"VOID":2142},"A5101790014",{"VOID":2144},"https:\u002F\u002Forcid.org\u002F0000-0002-2120-9239",{"EN":2146},"Xiaofeng Ren",{"id":2148,"sortIndex":115,"researcher":26,"roles":2149,"affiliations":2150,"properties":2162},"5d3687d5-8082-4332-9c4e-7c811ebf90e7",[],[2151],{"id":2152,"sortIndex":36,"affiliation":2153,"properties":26},"6189a8b9-eb62-4c3f-915c-c33040b1582c",{"id":2154,"createTime":2155,"updateTime":2156,"relativeEntities":2157,"slug":2158,"properties":2159,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"3fc8def4-5a42-4e98-a1ea-44d1c2ed5302","2024-01-14T21:38:26.572+00:00","2024-10-16T22:36:30.022+00:00",[],"Department-of-Computer-Science-and-Engineering-University-of-Washington-Seattle-WA-USA",{"title":2160},{"VI":2161},"Department of Computer Science and Engineering, University of Washington, Seattle, WA, USA",{"openalex":2163,"title":2165},{"VOID":2164},"A5015310139",{"EN":2166},"Michael Krainin",{"id":2168,"sortIndex":114,"researcher":26,"roles":2169,"affiliations":2170,"properties":2177},"cb86e25d-b3f8-4050-8633-72f3b2a9d2b1",[],[2171],{"id":2172,"sortIndex":36,"affiliation":2173,"properties":26},"4b84ff9d-3cdc-4867-854c-d6022f4279cc",{"id":2154,"createTime":2155,"updateTime":2156,"relativeEntities":2174,"slug":2158,"properties":2175,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2176},{"VI":2161},{"openalex":2178,"title":2180},{"VOID":2179},"A5001901561",{"EN":2181},"Evan Herbst",{"id":2183,"sortIndex":36,"researcher":26,"roles":2184,"affiliations":2185,"properties":2192},"932f3af0-a906-41c7-beb8-8ef5865040ea",[],[2186],{"id":2187,"sortIndex":36,"affiliation":2188,"properties":26},"7aa7bcc0-b6e9-47d8-8ed8-144421c08863",{"id":2154,"createTime":2155,"updateTime":2156,"relativeEntities":2189,"slug":2158,"properties":2190,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2191},{"VI":2161},{"openalex":2193,"title":2195},{"VOID":2194},"A5067373505",{"EN":2196},"Peter Henry",{"id":2198,"sortIndex":111,"researcher":26,"roles":2199,"affiliations":2200,"properties":2207},"628727d8-a43b-4ad2-8747-cc9cc3ce6416",[],[2201],{"id":2202,"sortIndex":36,"affiliation":2203,"properties":26},"429473b6-2955-4c8a-9829-b1f1965ef40a",{"id":2154,"createTime":2155,"updateTime":2156,"relativeEntities":2204,"slug":2158,"properties":2205,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2206},{"VI":2161},{"openalex":2208,"title":2210},{"VOID":2209},"A5014707300",{"EN":2211},"Dieter Fox",{"url":26,"publisher":2213,"properties":2238},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2214,"slug":663,"properties":2215,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2221,"manageAffiliations":2222,"indexDatabases":2223,"url":789,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":2216,"issn":2217,"introduce":2218,"eissn":2219,"title":2220},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[2224,2231],{"id":771,"indexDatabase":2225,"url":786,"indexYears":26,"academicFieldIds":2230,"indexDatabaseRanking":26},{"id":773,"createTime":774,"updateTime":775,"relativeEntities":2226,"label":2227,"description":2228,"key":782,"publicationTags":2229,"standard":26},[],{"EN":778,"VI":778},{"VI":780,"EN":781},[784,785],[788],{"id":747,"indexDatabase":2232,"url":760,"indexYears":761,"academicFieldIds":2237,"indexDatabaseRanking":769},{"id":749,"createTime":750,"updateTime":751,"relativeEntities":2233,"label":2234,"description":2235,"key":757,"publicationTags":2236,"standard":26},[],{"EN":754,"VI":754},{"EN":754,"VI":756},[759],[763,764,765,766,767,768],{"volume":2239,"pages":2241,"issue":2243},{"VOID":2240},"31",{"VOID":2242},"647-663",{"VOID":1060},1130,{"total":2244,"publishYear":26,"statisticByYear":2246},{"2012":241,"2013":2247,"2014":2248,"2015":121,"2016":633,"2017":2249,"2018":2250,"2019":533,"2020":2251,"2021":47,"2022":569,"2023":287,"2024":116},100,99,118,130,90,"2012-04-01",2012,[2255,2258,2261,2264,2267,2270,2273,2276,2279,2282,2285,2288,2291,2294,2297,2300,2303,2306,2309,2312,2315,2318,2321,2324,2327,2330,2333,2336,2339,2342,2345,2348,2351,2354,2357,2360,2363,2366,2369,2372,2375,2378,2381,2384,2387,2390,2393,2396,2399,2402,2405,2408,2411],{"id":26,"text":2256,"url":26,"identifiers":2257},"10.1109\u002F3DPVT.2006.141",{"doi":2256},{"id":26,"text":2259,"url":26,"identifiers":2260},"10.1016\u002Fj.robot.2009.09.011",{"doi":2259},{"id":26,"text":2262,"url":26,"identifiers":2263},"10.1109\u002F34.121791",{"doi":2262},{"id":26,"text":2265,"url":26,"identifiers":2266},"Bradski G (2000) The OpenCV Library. Dr. Dobb’s Journal of Software Tools. Available from: http:\u002F\u002Fdrdobbs.com\u002Fopen-source\u002F184404319",{},{"id":26,"text":2268,"url":26,"identifiers":2269},"10.1007\u002F978-3-540-88682-2_6",{"doi":2268},{"id":26,"text":2271,"url":26,"identifiers":2272},"10.1016\u002F0262-8856(92)90066-C",{"doi":2271},{"id":26,"text":2274,"url":26,"identifiers":2275},"10.15607\u002FRSS.2007.III.038",{"doi":2274},{"id":26,"text":2277,"url":26,"identifiers":2278},"10.1109\u002FCVPR.2010.5540082",{"doi":2277},{"id":26,"text":2280,"url":26,"identifiers":2281},"10.1145\u002F237170.237191",{"doi":2280},{"id":26,"text":2283,"url":26,"identifiers":2284},"Droeschel D, 2009, European Conference on Mobile Robots (ECMR)",{},{"id":26,"text":2286,"url":26,"identifiers":2287},"10.1145\u002F2030112.2030123",{"doi":2286},{"id":26,"text":2289,"url":26,"identifiers":2290},"10.1145\u002F358669.358692",{"doi":2289},{"id":26,"text":2292,"url":26,"identifiers":2293},"10.1109\u002FTPAMI.2009.161",{"doi":2292},{"id":26,"text":2295,"url":26,"identifiers":2296},"10.1109\u002FICCV.2009.5459145",{"doi":2295},{"id":26,"text":2298,"url":26,"identifiers":2299},"10.1109\u002FIROS.2007.4399030",{"doi":2298},{"id":26,"text":2301,"url":26,"identifiers":2302},"10.15607\u002FRSS.2007.III.009",{"doi":2301},{"id":26,"text":2304,"url":26,"identifiers":2305},"Henry P, 2010, Proceedings of the International Symposium on Experimental Robotics (ISER)",{},{"id":26,"text":2307,"url":26,"identifiers":2308},"10.1364\u002FJOSAA.4.000629",{"doi":2307},{"id":26,"text":2310,"url":26,"identifiers":2311},"10.1109\u002FIM.1997.603871",{"doi":2310},{"id":26,"text":2313,"url":26,"identifiers":2314},"10.1109\u002FICCVW.2009.5457430",{"doi":2313},{"id":26,"text":2316,"url":26,"identifiers":2317},"Konolige K, 2004, Proceedings of the National Conference on Artificial Intelligence (AAAI)",{},{"id":26,"text":2319,"url":26,"identifiers":2320},"10.1109\u002FROBOT.2010.5509796",{"doi":2319},{"id":26,"text":2322,"url":26,"identifiers":2323},"10.5244\u002FC.24.102",{"doi":2322},{"id":26,"text":2325,"url":26,"identifiers":2326},"10.1109\u002FTRO.2008.2004832",{"doi":2325},{"id":26,"text":2328,"url":26,"identifiers":2329},"10.1177\u002F0278364911403178",{"doi":2328},{"id":26,"text":2331,"url":26,"identifiers":2332},"10.1145\u002F1486525.1486527",{"doi":2331},{"id":26,"text":2334,"url":26,"identifiers":2335},"10.1023\u002FB:VISI.0000029664.99615.94",{"doi":2334},{"id":26,"text":2337,"url":26,"identifiers":2338},"10.1023\u002FA:1008854305733",{"doi":2337},{"id":26,"text":2340,"url":26,"identifiers":2341},"10.1002\u002Frob.20321",{"doi":2340},{"id":26,"text":2343,"url":26,"identifiers":2344},"10.1109\u002FCVPR.2010.5539794",{"doi":2343},{"id":26,"text":2346,"url":26,"identifiers":2347},"10.1177\u002F0278364909341483",{"doi":2346},{"id":26,"text":2349,"url":26,"identifiers":2350},"10.1109\u002FTPAMI.2004.17",{"doi":2349},{"id":26,"text":2352,"url":26,"identifiers":2353},"10.1109\u002FCVPR.2004.1315094",{"doi":2352},{"id":26,"text":2355,"url":26,"identifiers":2356},"10.1109\u002FCVPR.2006.264",{"doi":2355},{"id":26,"text":2358,"url":26,"identifiers":2359},"10.1145\u002F344779.344936",{"doi":2358},{"id":26,"text":2361,"url":26,"identifiers":2362},"10.1007\u002Fs11263-007-0086-4",{"doi":2361},{"id":26,"text":2364,"url":26,"identifiers":2365},"10.1504\u002FIJISTA.2008.021298",{"doi":2364},{"id":26,"text":2367,"url":26,"identifiers":2368},"10.15607\u002FRSS.2007.III.026",{"doi":2367},{"id":26,"text":2370,"url":26,"identifiers":2371},"10.1007\u002F11744023_34",{"doi":2370},{"id":26,"text":2373,"url":26,"identifiers":2374},"10.1109\u002FICRA.2011.5980220",{"doi":2373},{"id":26,"text":2376,"url":26,"identifiers":2377},"10.1109\u002FIM.2001.924423",{"doi":2376},{"id":26,"text":2379,"url":26,"identifiers":2380},"Se S, 2008, International Journal of Intelligent Control and Systems, 13, 47",{},{"id":26,"text":2382,"url":26,"identifiers":2383},"10.15607\u002FRSS.2009.V.021",{"doi":2382},{"id":26,"text":2385,"url":26,"identifiers":2386},"10.1109\u002F34.982886",{"doi":2385},{"id":26,"text":2388,"url":26,"identifiers":2389},"10.1109\u002FCVPR.2011.5995316",{"doi":2388},{"id":26,"text":2391,"url":26,"identifiers":2392},"10.1145\u002F1141911.1141964",{"doi":2391},{"id":26,"text":2394,"url":26,"identifiers":2395},"10.1109\u002FIROS.2009.5354708",{"doi":2394},{"id":26,"text":2397,"url":26,"identifiers":2398},"10.1109\u002FROBOT.2000.844077",{"doi":2397},{"id":26,"text":2400,"url":26,"identifiers":2401},"Thrun S, 2005, Probabilistic Robotics",{},{"id":26,"text":2403,"url":26,"identifiers":2404},"10.1006\u002Fcviu.1999.0832",{"doi":2403},{"id":26,"text":2406,"url":26,"identifiers":2407},"Triebel R, 2005, Proceedings of the National Conference on Artificial Intelligence (AAAI)",{},{"id":26,"text":2409,"url":26,"identifiers":2410},"Triggs B, 2000, Vision Algorithms: Theory and Practice, 1883, 153",{},{"id":26,"text":2412,"url":26,"identifiers":2413},"Wu C. (2007). SiftGPU: A GPU implementation of scale invariant feature transform (SIFT). Available at: http:\u002F\u002Fcs.unc.edu\u002F~ccwu\u002Fsiftgpu.",{},{"id":2415,"createTime":2416,"updateTime":2416,"relativeEntities":2417,"slug":2418,"properties":2419,"entityType":815,"verifyStatus":25,"verifyTime":2416,"verifyNote":817,"syncStatus":28,"languages":2431,"translateLanguages":26,"viewCount":36,"primaryUrl":2432,"fullTextUrl":26,"authors":2433,"publicationType":899,"publisherRelationship":2486,"citationCount":2518,"citationInfo":2519,"publishDate":2521,"publishYear":2522,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2523,"isForceReanalyzing":984},"17004252-15cd-4815-a14d-141625870237","2024-09-28T13:02:04.838+00:00",[],"Task-Priority-Based-Redundancy-Control-of-Robot-Manipulators",{"mag":2420,"keywords":2422,"openalex":2423,"abstract":2425,"title":2427,"doi":2429},{"VOID":2421},"2042803738",{},{"VOID":2424},"W2042803738",{"EN":2426},"\u003Cjats:p> In this paper, we describe a new scheme for redundancy control of robot manipulators. We introduce the concept of task priority in relation to the inverse kinematic problem of redundant robot manipulators. A required task is divided into subtasks according to the order of priority. We propose to determine the joint motions of robot manipulators so that subtasks with lower priority can be performed utilizing re dundancy on subtasks with higher priority. This procedure is formulated using the pseudoinverses of Jacobian matrices. Most problems of redundancy utilization can be formulated in the framework of tasks with the order of priority. The results of numerical simulations and experiments show the effectiveness of the proposed redundancy control scheme. \u003C\u002Fjats:p>",{"EN":2428},"Task-Priority Based Redundancy Control of Robot Manipulators",{"VOID":2430},"10.1177\u002F027836498700600201",[102],"https:\u002F\u002Fjournals.sagepub.com\u002Fdoi\u002F10.1177\u002F027836498700600201",[2434,2454,2471],{"id":2435,"sortIndex":115,"researcher":26,"roles":2436,"affiliations":2437,"properties":2449},"a89a148f-9dc8-4e7d-b278-4c79e162957f",[],[2438],{"id":2439,"sortIndex":36,"affiliation":2440,"properties":26},"c3f4cd87-e6a3-4958-8563-cfdd1247a57a",{"id":2441,"createTime":2442,"updateTime":2443,"relativeEntities":2444,"slug":2445,"properties":2446,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"7b10ac3b-94f3-425c-847a-c817a57359bf","2024-01-21T19:38:46.456+00:00","2024-09-28T13:02:04.850+00:00",[],"Automation-Research-Laboratory-Kyoto-University-Uji-Kyoto-611-Japan",{"title":2447},{"VI":2448},"Automation Research Laboratory, Kyoto University, Uji, Kyoto 611, Japan",{"openalex":2450,"title":2452},{"VOID":2451},"A5042283628",{"EN":2453},"Hideo Hanafusa",{"id":2455,"sortIndex":36,"researcher":26,"roles":2456,"affiliations":2457,"properties":2464},"11e6afbc-054b-4a16-8a04-e6b21a817bc5",[],[2458],{"id":2459,"sortIndex":36,"affiliation":2460,"properties":26},"b967b77f-a814-4b84-b2a1-8daf2be60510",{"id":2441,"createTime":2442,"updateTime":2443,"relativeEntities":2461,"slug":2445,"properties":2462,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2463},{"VI":2448},{"openalex":2465,"orcid":2467,"title":2469},{"VOID":2466},"A5040633710",{"VOID":2468},"https:\u002F\u002Forcid.org\u002F0000-0001-7162-5102",{"EN":2470},"Yoshihiko Nakamura",{"id":2472,"sortIndex":114,"researcher":26,"roles":2473,"affiliations":2474,"properties":2481},"e9a7815e-514c-40b8-a6ff-aa9697fbfcf4",[],[2475],{"id":2476,"sortIndex":36,"affiliation":2477,"properties":26},"5bfecbae-d6f6-4524-ad42-cc26be92d398",{"id":2441,"createTime":2442,"updateTime":2443,"relativeEntities":2478,"slug":2445,"properties":2479,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2480},{"VI":2448},{"openalex":2482,"title":2484},{"VOID":2483},"A5102278010",{"EN":2485},"Tsuneo Yoshikawa",{"url":26,"publisher":2487,"properties":2512},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2488,"slug":663,"properties":2489,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2495,"manageAffiliations":2496,"indexDatabases":2497,"url":789,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":2490,"issn":2491,"introduce":2492,"eissn":2493,"title":2494},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[2498,2505],{"id":771,"indexDatabase":2499,"url":786,"indexYears":26,"academicFieldIds":2504,"indexDatabaseRanking":26},{"id":773,"createTime":774,"updateTime":775,"relativeEntities":2500,"label":2501,"description":2502,"key":782,"publicationTags":2503,"standard":26},[],{"EN":778,"VI":778},{"VI":780,"EN":781},[784,785],[788],{"id":747,"indexDatabase":2506,"url":760,"indexYears":761,"academicFieldIds":2511,"indexDatabaseRanking":769},{"id":749,"createTime":750,"updateTime":751,"relativeEntities":2507,"label":2508,"description":2509,"key":757,"publicationTags":2510,"standard":26},[],{"EN":754,"VI":754},{"EN":754,"VI":756},[759],[763,764,765,766,767,768],{"volume":2513,"pages":2515,"issue":2517},{"VOID":2514},"6",{"VOID":2516},"3-15",{"VOID":1208},964,{"total":2518,"publishYear":26,"statisticByYear":2520},{"2012":244,"2013":222,"2014":125,"2015":287,"2016":125,"2017":286,"2018":608,"2019":287,"2020":286,"2021":48,"2022":255,"2023":397,"2024":53},"1987-06-01",1987,[2524,2527,2530,2533,2536,2539,2542,2545,2548,2551,2554,2557,2560,2563,2566,2569,2572,2575,2578],{"id":26,"text":2525,"url":26,"identifiers":2526},"10.1115\u002F1.3149621",{"doi":2525},{"id":26,"text":2528,"url":26,"identifiers":2529},"Boullion, T.L., 1971, Generalized inverse matrices",{},{"id":26,"text":2531,"url":26,"identifiers":2532},"Freund, E. 1977 (Tokyo). Path control for a redundant type of industrial robot. Proc. 7th Int. Symp. Industr. Robots, pp. 107-114.",{},{"id":26,"text":2534,"url":26,"identifiers":2535},"Hanafusa, H., Preprints 21st Joint Automatic Contr. Conf. in Japan",{},{"id":26,"text":2537,"url":26,"identifiers":2538},"Hanafusa, H., 8th Triennial IFA C World Congress 14",{},{"id":26,"text":2540,"url":26,"identifiers":2541},"10.9746\u002Fsicetr1965.19.421",{"doi":2540},{"id":26,"text":2543,"url":26,"identifiers":2544},"Khatib, O., Proc. 1985 Int. Conf. Robotics and Automation",{},{"id":26,"text":2546,"url":26,"identifiers":2547},"Khatib, O., Proc. 3rd Int. CISM-IFToMM Symp",{},{"id":26,"text":2549,"url":26,"identifiers":2550},"Klein, C.A., Preprints 2nd Int. Symp. Robotics Res",{},{"id":26,"text":2552,"url":26,"identifiers":2553},"10.1109\u002FTSMC.1983.6313123",{"doi":2552},{"id":26,"text":2555,"url":26,"identifiers":2556},"Konstantinov, M.S., Proc. 11th Int. Symp. Industr. Robots",{},{"id":26,"text":2558,"url":26,"identifiers":2559},"10.1109\u002FTSMC.1977.4309644",{"doi":2558},{"id":26,"text":2561,"url":26,"identifiers":2562},"10.1109\u002FTAC.1980.1102367",{"doi":2561},{"id":26,"text":2564,"url":26,"identifiers":2565},"10.1177\u002F027836498500400308",{"doi":2564},{"id":26,"text":2567,"url":26,"identifiers":2568},"10.1115\u002F1.3143764",{"doi":2567},{"id":26,"text":2570,"url":26,"identifiers":2571},"Nakano, E., and Ozaki, S. 1974 (Tokyo). Cooperative control of a pair of anthropomorphous manipulators— MELARM. Proc. 4th Int. Symp. Industr. Robots, pp. 250-260.",{},{"id":26,"text":2573,"url":26,"identifiers":2574},"10.1299\u002Fkikaic.45.314",{"doi":2573},{"id":26,"text":2576,"url":26,"identifiers":2577},"10.1109\u002FTMMS.1969.299896",{"doi":2576},{"id":26,"text":2579,"url":26,"identifiers":2580},"10.1115\u002F1.3426611",{"doi":2579},{"id":2582,"createTime":2583,"updateTime":2583,"relativeEntities":2584,"slug":2585,"properties":2586,"entityType":815,"verifyStatus":25,"verifyTime":2583,"verifyNote":817,"syncStatus":28,"languages":2598,"translateLanguages":26,"viewCount":36,"primaryUrl":2599,"fullTextUrl":26,"authors":2600,"publicationType":899,"publisherRelationship":2621,"citationCount":2652,"citationInfo":2653,"publishDate":2655,"publishYear":2522,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2656,"isForceReanalyzing":984},"8174d860-2a89-43c7-b2f2-d4c25ab7ea81","2024-09-17T19:52:34.767+00:00",[],"Historical-Perspective-and-State-of-the-Art-in-Robot-Force-Control",{"mag":2587,"keywords":2589,"openalex":2590,"abstract":2592,"title":2594,"doi":2596},{"VOID":2588},"2156102255",{},{"VOID":2591},"W2156102255",{"EN":2593},"\u003Cjats:p> This paper combines histarical lineage, assessment of the state of the art, and discussion of unsolved problems in robot force control. The difference between continuous and logic branching strategies is described. The development of various impedance strategies and hybrid methods is traced and com pared. The problem of stability is discussed, and remedies are related to higher strategy issues. \u003C\u002Fjats:p>",{"EN":2595},"Historical Perspective and State of the Art in Robot Force Control",{"VOID":2597},"10.1177\u002F027836498700600101",[102],"https:\u002F\u002Fjournals.sagepub.com\u002Fdoi\u002F10.1177\u002F027836498700600101",[2601],{"id":2602,"sortIndex":36,"researcher":26,"roles":2603,"affiliations":2604,"properties":2616},"1d1bc132-343f-45f0-a584-a5c860d50ba4",[],[2605],{"id":2606,"sortIndex":36,"affiliation":2607,"properties":26},"af9d6eff-5d61-4abc-b5b9-c9d5118dacf7",{"id":2608,"createTime":2609,"updateTime":2610,"relativeEntities":2611,"slug":2612,"properties":2613,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"d5b57e24-98eb-4041-9bbb-d54724500eb0","2024-09-03T02:56:56.306+00:00","2024-09-17T19:52:34.778+00:00",[],"Charles-Stark-Draper-Laboratory-Inc-Cambridge-Massachusetts-02139",{"title":2614},{"EN":2615},"Charles Stark Draper Laboratory, Inc., Cambridge, Massachusetts 02139",{"openalex":2617,"title":2619},{"VOID":2618},"A5068716485",{"EN":2620},"Daniel E. Whitney",{"url":26,"publisher":2622,"properties":2647},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2623,"slug":663,"properties":2624,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2630,"manageAffiliations":2631,"indexDatabases":2632,"url":789,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":2625,"issn":2626,"introduce":2627,"eissn":2628,"title":2629},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[2633,2640],{"id":771,"indexDatabase":2634,"url":786,"indexYears":26,"academicFieldIds":2639,"indexDatabaseRanking":26},{"id":773,"createTime":774,"updateTime":775,"relativeEntities":2635,"label":2636,"description":2637,"key":782,"publicationTags":2638,"standard":26},[],{"EN":778,"VI":778},{"VI":780,"EN":781},[784,785],[788],{"id":747,"indexDatabase":2641,"url":760,"indexYears":761,"academicFieldIds":2646,"indexDatabaseRanking":769},{"id":749,"createTime":750,"updateTime":751,"relativeEntities":2642,"label":2643,"description":2644,"key":757,"publicationTags":2645,"standard":26},[],{"EN":754,"VI":754},{"EN":754,"VI":756},[759],[763,764,765,766,767,768],{"volume":2648,"pages":2649,"issue":2651},{"VOID":2514},{"VOID":2650},"3-14",{"VOID":1064},763,{"total":2652,"publishYear":26,"statisticByYear":2654},{"2012":51,"2013":52,"2014":103,"2015":158,"2016":516,"2017":356,"2018":237,"2019":239,"2020":135,"2021":356,"2022":356,"2023":158,"2024":111},"1987-03-01",[2657,2660,2663,2666,2669,2672,2675,2678,2681,2684,2687,2690,2693,2696,2699,2702,2705,2708,2711,2714,2717,2720,2723,2726,2729,2732,2735,2738,2740,2743,2746],{"id":26,"text":2658,"url":26,"identifiers":2659},"Barber, J.D., 1967, MANTRAN: A symbolic language for supervisory control of an intelligent remote manipulator. S.M. thesis",{},{"id":26,"text":2661,"url":26,"identifiers":2662},"Borrel, P., 1979, Modèle de comportement des manipulateurs, applications à I'analyse de leurs performances et à leur commande automatique",{},{"id":26,"text":2664,"url":26,"identifiers":2665},"Cannon, R.H., Presented at Intelligent Controls: Achievements and Issues",{},{"id":26,"text":2667,"url":26,"identifiers":2668},"DeFazio, T.L., 1984, Industr. Robot, 11, 238",{},{"id":26,"text":2670,"url":26,"identifiers":2671},"Drake, S.K., IFAC Symp. Information and Contr. Problems in Manufacturing Technology",{},{"id":26,"text":2673,"url":26,"identifiers":2674},"Drake, S.H., Proc. 5th Int. Symp. Industr. Robots",{},{"id":26,"text":2676,"url":26,"identifiers":2677},"Ernst, H.A., 1961, MH 1-a computer operated mechanical hand. Sc.D. thesis",{},{"id":26,"text":2679,"url":26,"identifiers":2680},"10.1109\u002FTHFE.1965.6591253",{"doi":2679},{"id":26,"text":2682,"url":26,"identifiers":2683},"10.1177\u002F001872086600800509",{"doi":2682},{"id":26,"text":2685,"url":26,"identifiers":2686},"10.1109\u002FMSPEC.1967.5217126",{"doi":2685},{"id":26,"text":2688,"url":26,"identifiers":2689},"Goertz, R.C., 1952, Nucleonics, 10, 36",{},{"id":26,"text":2691,"url":26,"identifiers":2692},"Groome, R.C., 1972, Force feedback steering of a teleoperator system. S. M. thesis",{},{"id":26,"text":2694,"url":26,"identifiers":2695},"Hanafusa, H., IFAC Symp. Information and Contr. Problems in Manufacturing Technology",{},{"id":26,"text":2697,"url":26,"identifiers":2698},"Hill, J.W., 17th Annual Human Factors Convention",{},{"id":26,"text":2700,"url":26,"identifiers":2701},"Hogan, N., Proc. 1980 JACC",{},{"id":26,"text":2703,"url":26,"identifiers":2704},"Khatib, O., Proc. 3rd Int. Symp. Robotics Res",{},{"id":26,"text":2706,"url":26,"identifiers":2707},"10.1109\u002FTSMC.1981.4308708",{"doi":2706},{"id":26,"text":2709,"url":26,"identifiers":2710},"Nevins, J.L., Proc. 1st CISM-IFTOMM Symp. on Theory and Practice of Robots and Manipulators",{},{"id":26,"text":2712,"url":26,"identifiers":2713},"Paul, R.P., 1976, Proc. JACC, 694",{},{"id":26,"text":2715,"url":26,"identifiers":2716},"10.1115\u002F1.3139652",{"doi":2715},{"id":26,"text":2718,"url":26,"identifiers":2719},"Roberts, R.K., 1985, Proc. IEEE Conf. on Robotics and Automation.",{},{"id":26,"text":2721,"url":26,"identifiers":2722},"Rothchild, R.A., Proc. 1966 Symp. on Biomedical Eng",{},{"id":26,"text":2724,"url":26,"identifiers":2725},"Salisbury, J.K., Proc. 19th IEEE Conf. on Decision and Contr",{},{"id":26,"text":2727,"url":26,"identifiers":2728},"10.1177\u002F027836498200100102",{"doi":2727},{"id":26,"text":2730,"url":26,"identifiers":2731},"10.1109\u002FROBOT.1985.1087272",{"doi":2730},{"id":26,"text":2733,"url":26,"identifiers":2734},"Watson, P.C., 1st North Amer. Robot Conf",{},{"id":26,"text":2736,"url":26,"identifiers":2737},"West, H., Proc. 1985 IEEE Conf. Robotics and Automation",{},{"id":26,"text":2579,"url":26,"identifiers":2739},{"doi":2579},{"id":26,"text":2741,"url":26,"identifiers":2742},"10.1115\u002F1.3427095",{"doi":2741},{"id":26,"text":2744,"url":26,"identifiers":2745},"Whitney, D. E., 1985, Touching experiences, a history of robot force feedback",{},{"id":26,"text":2747,"url":26,"identifiers":2748},"Whitney, D.E., Proc. 1984 ACC",{},{"id":2750,"createTime":2751,"updateTime":2751,"relativeEntities":2752,"slug":2753,"properties":2754,"entityType":815,"verifyStatus":25,"verifyTime":2751,"verifyNote":817,"syncStatus":28,"languages":2766,"translateLanguages":26,"viewCount":36,"primaryUrl":2767,"fullTextUrl":26,"authors":2768,"publicationType":899,"publisherRelationship":2837,"citationCount":2869,"citationInfo":2870,"publishDate":2873,"publishYear":2874,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2875,"isForceReanalyzing":984},"6a228011-b526-4631-947b-20b3528f9c9f","2024-09-03T00:18:04.175+00:00",[],"Path-Planning-for-Autonomous-Vehicles-in-Unknown-Semi-structured-Environments",{"mag":2755,"keywords":2757,"openalex":2758,"abstract":2760,"title":2762,"doi":2764},{"VOID":2756},"1996183429",{},{"VOID":2759},"W1996183429",{"EN":2761},"\u003Cjats:p> We describe a practical path-planning algorithm for an autonomous vehicle operating in an unknown semi-structured (or unstructured) environment, where obstacles are detected online by the robot’s sensors. This work was motivated by and experimentally validated in the 2007 DARPA Urban Challenge, where robotic vehicles had to autonomously navigate parking lots. The core of our approach to path planning consists of two phases. The first phase uses a variant of A* search (applied to the 3D kinematic state space of the vehicle) to obtain a kinematically feasible trajectory. The second phase then improves the quality of the solution via numeric non-linear optimization, leading to a local (and frequently global) optimum. Further, we extend our algorithm to use prior topological knowledge of the environment to guide path planning, leading to faster search and final trajectories better suited to the structure of the environment. We present experimental results from the DARPA Urban Challenge, where our robot demonstrated near-flawless performance in complex general path-planning tasks such as navigating parking lots and executing U-turns on blocked roads. We also present results on autonomous navigation of real parking lots. In those latter tasks, which are significantly more complex than the ones in the DARPA Urban Challenge, the time of a full replanning cycle of our planner is in the range of 50—300 ms. \u003C\u002Fjats:p>",{"EN":2763},"Path Planning for Autonomous Vehicles in Unknown Semi-structured Environments",{"VOID":2765},"10.1177\u002F0278364909359210",[102],"http:\u002F\u002Fjournals.sagepub.com\u002Fdoi\u002F10.1177\u002F0278364909359210",[2769,2788,2807,2822],{"id":2770,"sortIndex":115,"researcher":26,"roles":2771,"affiliations":2772,"properties":2783},"ba5aae86-af73-4b04-bf35-e7452ea3ab23",[],[2773],{"id":2774,"sortIndex":36,"affiliation":2775,"properties":26},"ff4ae983-06ea-4cee-9da9-b69bfeedf831",{"id":2776,"createTime":2777,"updateTime":2777,"relativeEntities":2778,"slug":2779,"properties":2780,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"eab71e18-e9b0-435e-9d87-5e99155e27e7","2024-09-03T00:18:04.208+00:00",[],"Stanford-Artificial-Intelligence-Laboratory-Stanford-University-Stanford-CA-94305-USA-",{"title":2781},{"EN":2782},"Stanford Artificial Intelligence Laboratory, Stanford University, Stanford CA 94305, USA,",{"openalex":2784,"title":2786},{"VOID":2785},"A5066710774",{"EN":2787},"Sebastian Thrun",{"id":2789,"sortIndex":36,"researcher":26,"roles":2790,"affiliations":2791,"properties":2802},"4ec9750f-421a-4662-8c12-945c9208fc11",[],[2792],{"id":2793,"sortIndex":36,"affiliation":2794,"properties":26},"0faab66a-a9b1-4c07-a780-932b1b2603f8",{"id":2795,"createTime":2796,"updateTime":2796,"relativeEntities":2797,"slug":2798,"properties":2799,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"b056fdbc-f132-4034-8967-d60d99f32500","2024-09-03T00:18:04.192+00:00",[],"AI-Robotics-Group-Toyota-Research-Institute-Ann-Arbor-MI-48105-USA-",{"title":2800},{"EN":2801},"AI & Robotics Group, Toyota Research Institute, Ann Arbor, MI 48105, USA,",{"openalex":2803,"title":2805},{"VOID":2804},"A5078105138",{"EN":2806},"Dmitri Dolgov",{"id":2808,"sortIndex":59,"researcher":26,"roles":2809,"affiliations":2810,"properties":2817},"5cba77eb-9249-4dc5-9054-344bf63c4855",[],[2811],{"id":2812,"sortIndex":36,"affiliation":2813,"properties":26},"51509c56-0e92-4c03-af32-02568516e9e0",{"id":2776,"createTime":2777,"updateTime":2777,"relativeEntities":2814,"slug":2779,"properties":2815,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2816},{"EN":2782},{"openalex":2818,"title":2820},{"VOID":2819},"A5021412020",{"EN":2821},"James Diebel",{"id":2823,"sortIndex":114,"researcher":26,"roles":2824,"affiliations":2825,"properties":2832},"b72c6568-fb0b-4da5-a8c5-7e3f70bd986a",[],[2826],{"id":2827,"sortIndex":36,"affiliation":2828,"properties":26},"c0f1d7dc-0c50-4f8c-a892-384bad64e0b0",{"id":2776,"createTime":2777,"updateTime":2777,"relativeEntities":2829,"slug":2779,"properties":2830,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2831},{"EN":2782},{"openalex":2833,"title":2835},{"VOID":2834},"A5048767051",{"EN":2836},"Michael Montemerlo",{"url":26,"publisher":2838,"properties":2863},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2839,"slug":663,"properties":2840,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2846,"manageAffiliations":2847,"indexDatabases":2848,"url":789,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":2841,"issn":2842,"introduce":2843,"eissn":2844,"title":2845},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[2849,2856],{"id":771,"indexDatabase":2850,"url":786,"indexYears":26,"academicFieldIds":2855,"indexDatabaseRanking":26},{"id":773,"createTime":774,"updateTime":775,"relativeEntities":2851,"label":2852,"description":2853,"key":782,"publicationTags":2854,"standard":26},[],{"EN":778,"VI":778},{"VI":780,"EN":781},[784,785],[788],{"id":747,"indexDatabase":2857,"url":760,"indexYears":761,"academicFieldIds":2862,"indexDatabaseRanking":769},{"id":749,"createTime":750,"updateTime":751,"relativeEntities":2858,"label":2859,"description":2860,"key":757,"publicationTags":2861,"standard":26},[],{"EN":754,"VI":754},{"EN":754,"VI":756},[759],[763,764,765,766,767,768],{"volume":2864,"pages":2866,"issue":2868},{"VOID":2865},"29",{"VOID":2867},"485-501",{"VOID":1060},699,{"total":2869,"publishYear":26,"statisticByYear":2871},{"2012":336,"2013":124,"2014":260,"2015":244,"2016":287,"2017":284,"2018":608,"2019":245,"2020":401,"2021":2247,"2022":348,"2023":2872,"2024":252},87,"2010-04-01",2010,[2876,2879,2882,2885,2889,2893,2896,2899,2902,2905,2908,2911,2914,2917,2920,2923,2926,2929,2932,2935,2937,2940,2943,2946,2949,2952,2955,2958,2961,2964,2967,2970,2973,2976,2979,2982,2985,2988,2991,2994,2997,3000],{"id":26,"text":2877,"url":26,"identifiers":2878},"Andrews, J. and Hogan, N. ( 1983). Impedance control as a framework for implementing obstacle avoidance in a manipulator. Control of Manufacturing Processes and Robotic Systems, Boston: ASME: pp. 243-251.",{},{"id":26,"text":2880,"url":26,"identifiers":2881},"Bekris, K.E., 2007, International Conference on Robotics and Automation, 704",{},{"id":26,"text":2883,"url":26,"identifiers":2884},"Buehler, M., 2005, The 2005 DARPA Grand Challenge: The Great Robot Race",{},{"id":26,"text":2886,"url":26,"identifiers":2887},"2008, Journal of Field Robotics, 25, 423, 10.1002\u002Frob.20257",{"doi":2888},"10.1002\u002Frob.20257",{"id":26,"text":2890,"url":26,"identifiers":2891},"2008, Journal of Field Robotics, 25, 567, 10.1002\u002Frob.20259",{"doi":2892},"10.1002\u002Frob.20259",{"id":26,"text":2894,"url":26,"identifiers":2895},"10.1177\u002F02783640022066770",{"doi":2894},{"id":26,"text":2897,"url":26,"identifiers":2898},"Choset, H., 2005, Principles of Robot Motion: Theory, Algorithms, and Implementations",{},{"id":26,"text":2900,"url":26,"identifiers":2901},"Connolly, C., IEEE International Conference on Robotics and Automation (ICRA)",{},{"id":26,"text":2903,"url":26,"identifiers":2904},"10.1002\u002Frob.20135",{"doi":2903},{"id":26,"text":2906,"url":26,"identifiers":2907},"Dolgov, D., Proceedings of the 2009 IEEE International Conference on Robotics and Automation (ICRA-09)",{},{"id":26,"text":2909,"url":26,"identifiers":2910},"Dolgov, D., Proceedings of the First International Symposium on Search Techniques in Artificial Intelligence and Robotics (STAIR-08)",{},{"id":26,"text":2912,"url":26,"identifiers":2913},"Ersson, T., IEEE International Conference on Intelligent Robots and Systems (IROS)",{},{"id":26,"text":2915,"url":26,"identifiers":2916},"Ferguson, D., Proceedings of the International Symposium on Robotics Research (ISRR)",{},{"id":26,"text":2918,"url":26,"identifiers":2919},"Fraichard, T., Proceedings of the IEEE International Conference on Robotics and Automation",{},{"id":26,"text":2921,"url":26,"identifiers":2922},"Fraichard, T., Proceedings of the IEEE International Conference on Advanced Robotics",{},{"id":26,"text":2924,"url":26,"identifiers":2925},"10.1109\u002FTSSC.1968.300136",{"doi":2924},{"id":26,"text":2927,"url":26,"identifiers":2928},"10.1145\u002F1056777.1056779",{"doi":2927},{"id":26,"text":2930,"url":26,"identifiers":2931},"10.1002\u002Frob.20252",{"doi":2930},{"id":26,"text":2933,"url":26,"identifiers":2934},"10.1109\u002F70.508439",{"doi":2933},{"id":26,"text":1005,"url":26,"identifiers":2936},{"doi":1005},{"id":26,"text":2938,"url":26,"identifiers":2939},"Koditschek, D.E., IEEE International Conference on Robotics and Automation (ICRA)",{},{"id":26,"text":2941,"url":26,"identifiers":2942},"Koenig, S., IEEE International Conference on Robotics and Automation (ICRA)",{},{"id":26,"text":2944,"url":26,"identifiers":2945},"Koren, Y., IEEE International Conference on Robotics and Automation (ICRA)",{},{"id":26,"text":2947,"url":26,"identifiers":2948},"10.1109\u002F70.954762",{"doi":2947},{"id":26,"text":2950,"url":26,"identifiers":2951},"Laumond, J.-P., 1998, Robot Motion Planning and Control, 1",{},{"id":26,"text":2953,"url":26,"identifiers":2954},"LaValle, S., 1998, Rapidly-exploring random trees: a new tool for path planning",{},{"id":26,"text":2956,"url":26,"identifiers":2957},"10.1017\u002FCBO9780511546877",{"doi":2956},{"id":26,"text":2959,"url":26,"identifiers":2960},"Likhachev, M., Proceedings of Robotics: Science and Systems IV",{},{"id":26,"text":2962,"url":26,"identifiers":2963},"10.1002\u002Frob.20253",{"doi":2962},{"id":26,"text":2965,"url":26,"identifiers":2966},"Miyazaki, F., 1985, Journal of Robotic Systems, 2, 53",{},{"id":26,"text":2968,"url":26,"identifiers":2969},"Nash, A., Proceedings of the AAAI Conference on Artificial Intelligence (AAAI)",{},{"id":26,"text":2971,"url":26,"identifiers":2972},"Pavlov, V., 1984, Soviet Automatic Control, 17, 45",{},{"id":26,"text":2974,"url":26,"identifiers":2975},"Pivtoraiko, M., 2007, Technical Report",{},{"id":26,"text":2977,"url":26,"identifiers":2978},"10.15607\u002FRSS.2007.III.040",{"doi":2977},{"id":26,"text":2980,"url":26,"identifiers":2981},"10.2140\u002Fpjm.1990.145.367",{"doi":2980},{"id":26,"text":2983,"url":26,"identifiers":2984},"10.1109\u002F70.163777",{"doi":2983},{"id":26,"text":2986,"url":26,"identifiers":2987},"10.1145\u002F321356.321357",{"doi":2986},{"id":26,"text":2989,"url":26,"identifiers":2990},"Scheuer, A., Proceedings of the IEEE-RSJ International Conference on Intelligent Robots and Systems",{},{"id":26,"text":2992,"url":26,"identifiers":2993},"Seo, Y.-W., Proceedings of International Joint Conference on Artificial Intelligence (IJCAI-09)",{},{"id":26,"text":2995,"url":26,"identifiers":2996},"Stentz, A., Proceedings of the International Joint Conference on Artificial Intelligence",{},{"id":26,"text":2998,"url":26,"identifiers":2999},"Tilove, R., IEEE International Conference on Robotics and Automation",{},{"id":26,"text":3001,"url":26,"identifiers":3002},"10.1002\u002Frob.20255",{"doi":3001},{"id":3004,"createTime":3005,"updateTime":3005,"relativeEntities":3006,"slug":3007,"properties":3008,"entityType":815,"verifyStatus":28,"verifyTime":3005,"verifyNote":3020,"syncStatus":28,"languages":3021,"translateLanguages":26,"viewCount":36,"primaryUrl":3022,"fullTextUrl":26,"authors":3023,"publicationType":899,"publisherRelationship":3129,"citationCount":3162,"citationInfo":3163,"publishDate":3165,"publishYear":3166,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":3167,"isForceReanalyzing":984},"4f73ae1c-ffaa-4134-8d7e-ba45e525cdb0","2024-09-02T00:47:36.261+00:00",[],"Simultaneous-Localization-and-Mapping-with-Sparse-Extended-Information-Filters",{"mag":3009,"keywords":3011,"openalex":3012,"abstract":3014,"title":3016,"doi":3018},{"VOID":3010},"1977464512",{},{"VOID":3013},"W1977464512",{"EN":3015},"\u003Cjats:p> In this paper we describe a scalable algorithm for the simultaneous mapping and localization (SLAM) problem. SLAM is the problem of acquiring a map of a static environment with a mobile robot. The vast majority of SLAM algorithms are based on the extended Kalman filter (EKF). In this paper we advocate an algorithm that relies on the dual of the EKF, the extended information filter (EIF). We show that when represented in the information form, map posteriors are dominated by a small number of links that tie together nearby features in the map. This insight is developed into a sparse variant of the EIF, called the sparse extended information filter (SEIF). SEIFs represent maps by graphical networks of features that are locally interconnected, where links represent relative information between pairs of nearby features, as well as information about the robot’s pose relative to the map. We show that all essential update equations in SEIFs can be executed in constant time, irrespective of the size of the map. We also provide empirical results obtained for a benchmark data set collected in an outdoor environment, and using a multi-robot mapping simulation. \u003C\u002Fjats:p>",{"EN":3017},"Simultaneous Localization and Mapping with Sparse Extended Information Filters",{"VOID":3019},"10.1177\u002F0278364904045479","Author affiliation is blank",[102],"http:\u002F\u002Fjournals.sagepub.com\u002Fdoi\u002F10.1177\u002F0278364904045479",[3024,3044,3051,3071,3093,3118],{"id":3025,"sortIndex":111,"researcher":26,"roles":3026,"affiliations":3027,"properties":3039},"14d81c6d-7d2d-49d6-b1cd-5c2dea8fb8b4",[],[3028],{"id":3029,"sortIndex":36,"affiliation":3030,"properties":26},"2ced78b4-5d2d-45f7-8486-39ddbb362565",{"id":3031,"createTime":3032,"updateTime":3033,"relativeEntities":3034,"slug":3035,"properties":3036,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"0c2f7790-d1c8-4073-980d-382f058d057d","2024-01-30T02:56:15.054+00:00","2025-06-12T01:01:08.411+00:00",[],"Gatsby-Computational-Neuroscience-Unit-University-College-London-UK",{"title":3037},{"VI":3038},"Gatsby Computational Neuroscience Unit, University College London, UK",{"openalex":3040,"title":3042},{"VOID":3041},"A5010820865",{"EN":3043},"Zoubin Ghahramani",{"id":3045,"sortIndex":36,"researcher":26,"roles":3046,"affiliations":3047,"properties":3048},"6607d442-de2a-401b-8944-9b38ea365fc8",[],[],{"openalex":3049,"title":3050},{"VOID":2785},{"EN":2787},{"id":3052,"sortIndex":162,"researcher":26,"roles":3053,"affiliations":3054,"properties":3066},"1f9cb5bd-caaa-40d2-bf4a-539a04c0c0a7",[],[3055],{"id":3056,"sortIndex":36,"affiliation":3057,"properties":26},"58181820-4fcf-4adc-b4a3-6e48a16c4dde",{"id":3058,"createTime":3059,"updateTime":3060,"relativeEntities":3061,"slug":3062,"properties":3063,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"19cc30e7-c73c-4b7f-8a13-2fde83c6d093","2024-04-18T17:04:15.165+00:00","2025-01-31T04:01:50.792+00:00",[],"University-of-Sydney-Sydney-Australia",{"title":3064},{"EN":3065},"University of Sydney, Sydney, Australia",{"openalex":3067,"title":3069},{"VOID":3068},"A5024822861",{"EN":3070},"Hugh Durrant‐Whyte",{"id":3072,"sortIndex":115,"researcher":26,"roles":3073,"affiliations":3074,"properties":3086},"7b8ce910-9299-4682-b24f-f1f060508cb7",[],[3075],{"id":3076,"sortIndex":36,"affiliation":3077,"properties":26},"2411ea91-4e1b-4941-b5fb-058133667cd6",{"id":3078,"createTime":3079,"updateTime":3080,"relativeEntities":3081,"slug":3082,"properties":3083,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"91edb79a-eaa7-4d80-8823-947b0502e91d","2024-09-02T00:47:36.278+00:00","2025-02-08T00:39:29.097+00:00",[],"Carnegie-Mellon-University-Pittsburgh-Pa-USA-TAB-",{"title":3084},{"EN":3085},"Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#",{"openalex":3087,"orcid":3089,"title":3091},{"VOID":3088},"A5062098553",{"VOID":3090},"https:\u002F\u002Forcid.org\u002F0000-0002-2355-4706",{"EN":3092},"Yufeng Liu",{"id":3094,"sortIndex":59,"researcher":26,"roles":3095,"affiliations":3096,"properties":3111},"7162225e-6a4f-4a47-a7f3-97af3b965b01",[],[3097],{"id":3098,"sortIndex":36,"affiliation":3099,"properties":3108},"e83dbe7b-d572-4322-9a57-42bec8287e89",{"id":3100,"createTime":3101,"updateTime":3102,"relativeEntities":3103,"slug":3104,"properties":3105,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"44d8f693-496e-4bae-a472-ac5278225ba5","2023-12-25T14:46:28.966+00:00","2025-02-09T12:22:27.457+00:00",[],"Stanford-University-Stanford-CA-United-States",{"title":3106},{"VI":3107},"Stanford University, Stanford, CA, United States",{"title":3109},{"EN":3110},"Stanford University, Stanford, CA, USA",{"openalex":3112,"orcid":3114,"title":3116},{"VOID":3113},"A5023259221",{"VOID":3115},"https:\u002F\u002Forcid.org\u002F0000-0002-0016-2275",{"EN":3117},"Andrew Y. Ng",{"id":3119,"sortIndex":114,"researcher":26,"roles":3120,"affiliations":3121,"properties":3122},"1f1ca8e1-5c63-4732-89e5-bb608a6a8872",[],[],{"openalex":3123,"orcid":3125,"title":3127},{"VOID":3124},"A5051658526",{"VOID":3126},"https:\u002F\u002Forcid.org\u002F0000-0002-2361-6479",{"EN":3128},"Daphne Koller",{"url":26,"publisher":3130,"properties":3155},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":3131,"slug":663,"properties":3132,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":3138,"manageAffiliations":3139,"indexDatabases":3140,"url":789,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":3133,"issn":3134,"introduce":3135,"eissn":3136,"title":3137},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[3141,3148],{"id":771,"indexDatabase":3142,"url":786,"indexYears":26,"academicFieldIds":3147,"indexDatabaseRanking":26},{"id":773,"createTime":774,"updateTime":775,"relativeEntities":3143,"label":3144,"description":3145,"key":782,"publicationTags":3146,"standard":26},[],{"EN":778,"VI":778},{"VI":780,"EN":781},[784,785],[788],{"id":747,"indexDatabase":3149,"url":760,"indexYears":761,"academicFieldIds":3154,"indexDatabaseRanking":769},{"id":749,"createTime":750,"updateTime":751,"relativeEntities":3150,"label":3151,"description":3152,"key":757,"publicationTags":3153,"standard":26},[],{"EN":754,"VI":754},{"EN":754,"VI":756},[759],[763,764,765,766,767,768],{"volume":3156,"pages":3158,"issue":3160},{"VOID":3157},"23",{"VOID":3159},"693-716",{"VOID":3161},"7-8",634,{"total":3162,"publishYear":26,"statisticByYear":3164},{"2012":287,"2013":79,"2014":252,"2015":125,"2016":173,"2017":396,"2018":234,"2019":516,"2020":260,"2021":103,"2022":53,"2023":135,"2024":114},"2004-08-01",2004,[3168,3171,3174,3177,3180,3183,3186,3188,3191,3194,3197,3200,3203],{"id":26,"text":3169,"url":26,"identifiers":3170},"10.1207\u002Fs15516709cog1901_1",{"doi":3169},{"id":26,"text":3172,"url":26,"identifiers":3173},"10.1109\u002F70.938381",{"doi":3172},{"id":26,"text":3175,"url":26,"identifiers":3176},"10.1109\u002F70.938382",{"doi":3175},{"id":26,"text":3178,"url":26,"identifiers":3179},"10.1109\u002F71.598277",{"doi":3178},{"id":26,"text":3181,"url":26,"identifiers":3182},"10.1016\u002F0921-8890(91)90014-C",{"doi":3181},{"id":26,"text":3184,"url":26,"identifiers":3185},"10.1145\u002F99935.99949",{"doi":3184},{"id":26,"text":2337,"url":26,"identifiers":3187},{"doi":2337},{"id":26,"text":3189,"url":26,"identifiers":3190},"Moravec, H. P. 1988. Sensor fusion in certainty grids for mobile robots . AI Magazine 9(2): 61–74 .",{},{"id":26,"text":3192,"url":26,"identifiers":3193},"10.1177\u002F027836498600500404",{"doi":3192},{"id":26,"text":3195,"url":26,"identifiers":3196},"10.1177\u002F027836402320556340",{"doi":3195},{"id":26,"text":3198,"url":26,"identifiers":3199},"10.1177\u002F02783640122067435",{"doi":3198},{"id":26,"text":3201,"url":26,"identifiers":3202},"10.1023\u002FA:1007436523611",{"doi":3201},{"id":26,"text":3204,"url":26,"identifiers":3205},"10.1162\u002F089976601750541769",{"doi":3204},{"id":3207,"createTime":3208,"updateTime":3208,"relativeEntities":3209,"slug":3210,"properties":3211,"entityType":815,"verifyStatus":25,"verifyTime":3223,"verifyNote":817,"syncStatus":28,"languages":3224,"translateLanguages":26,"viewCount":36,"primaryUrl":3225,"fullTextUrl":26,"authors":3226,"publicationType":899,"publisherRelationship":3246,"citationCount":3279,"citationInfo":3280,"publishDate":3282,"publishYear":3283,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":3284,"isForceReanalyzing":984},"7d1ce27d-def6-4d64-b76a-4246dcb1452c","2024-09-11T19:06:15.256+00:00",[],"The-Kinematics-of-Contact-and-Grasp",{"mag":3212,"keywords":3214,"openalex":3215,"abstract":3217,"title":3219,"doi":3221},{"VOID":3213},"2017444601",{},{"VOID":3216},"W2017444601",{"EN":3218},"\u003Cjats:p> The kinematics of contact describe the motion of a point of contact over the surfaces of two contacting objects in response to a relative motion of these objects. Using concepts from differential geometry, I derive a set of equations, called the contact equations, that embody this relationship. I employ the contact equations to design the following applications to be executed by an end-effector with tactile sensing capability: ( 1) determining the curvature form of an unknown object at a point of contact; and ( 2) following the surface of an unknown object. The contact equations also serve as a basis for an investigation of the kinematics of grasp. I derive the relation ship between the relative motion of two fingers grasping an object and the motion of the points of contact over the object surface. Based on this analysis, we explore the following applications: ( 1) rolling a sphere between two arbitrarily shaped fingers ; ( 2) fine grip adjustment ( i.e., having two fingers that grasp an unknown object locally optimize their grip for maximum stability). \u003C\u002Fjats:p>",{"EN":3220},"The Kinematics of Contact and Grasp",{"VOID":3222},"10.1177\u002F027836498800700302","2024-09-11T19:06:15.255+00:00",[102],"http:\u002F\u002Fjournals.sagepub.com\u002Fdoi\u002F10.1177\u002F027836498800700302",[3227],{"id":3228,"sortIndex":36,"researcher":26,"roles":3229,"affiliations":3230,"properties":3241},"cfa4bfde-2eea-4c1e-85eb-f06e721bef0a",[],[3231],{"id":3232,"sortIndex":36,"affiliation":3233,"properties":26},"96268d83-4582-4284-9cee-1c09755b2354",{"id":3234,"createTime":3235,"updateTime":3235,"relativeEntities":3236,"slug":3237,"properties":3238,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"cbcc6675-7987-418a-bba6-1c364b4b5a9d","2024-09-11T19:06:15.277+00:00",[],"BBN-Laboratories-Inc-70-Fawcett-Street-Cambridge-Massachusetts-02138",{"title":3239},{"EN":3240},"BBN Laboratories, Inc. 70 Fawcett Street Cambridge, Massachusetts 02138",{"openalex":3242,"title":3244},{"VOID":3243},"A5103330610",{"EN":3245},"David J. Montana",{"url":26,"publisher":3247,"properties":3272},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":3248,"slug":663,"properties":3249,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":3255,"manageAffiliations":3256,"indexDatabases":3257,"url":789,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":3250,"issn":3251,"introduce":3252,"eissn":3253,"title":3254},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[3258,3265],{"id":771,"indexDatabase":3259,"url":786,"indexYears":26,"academicFieldIds":3264,"indexDatabaseRanking":26},{"id":773,"createTime":774,"updateTime":775,"relativeEntities":3260,"label":3261,"description":3262,"key":782,"publicationTags":3263,"standard":26},[],{"EN":778,"VI":778},{"VI":780,"EN":781},[784,785],[788],{"id":747,"indexDatabase":3266,"url":760,"indexYears":761,"academicFieldIds":3271,"indexDatabaseRanking":769},{"id":749,"createTime":750,"updateTime":751,"relativeEntities":3267,"label":3268,"description":3269,"key":757,"publicationTags":3270,"standard":26},[],{"EN":754,"VI":754},{"EN":754,"VI":756},[759],[763,764,765,766,767,768],{"volume":3273,"pages":3275,"issue":3277},{"VOID":3274},"7",{"VOID":3276},"17-32",{"VOID":3278},"3",527,{"total":3279,"publishYear":26,"statisticByYear":3281},{"2012":50,"2013":103,"2014":158,"2015":116,"2016":173,"2017":116,"2018":298,"2019":103,"2020":103,"2021":116,"2022":135,"2023":158,"2024":114},"1988-06-01",1988,[3285,3288,3291,3294,3297,3300,3303,3306,3309,3312,3314,3317,3320,3323,3326],{"id":26,"text":3286,"url":26,"identifiers":3287},"Bajcsy, R. 1984. What can we learn from one finger experiments ? 1st Symp. on Robotics Research: 509 - 527. Cambridge, Mass.: MIT Press.",{},{"id":26,"text":3289,"url":26,"identifiers":3290},"Cai, C., 1986, Mechanism and Machine Theory",{},{"id":26,"text":3292,"url":26,"identifiers":3293},"Cai, C., Proc. 1987 IEEE Conf. on Robotics and Automation",{},{"id":26,"text":3295,"url":26,"identifiers":3296},"Campbell, S.L., 1979, Generalised inverses of linear transformations",{},{"id":26,"text":3298,"url":26,"identifiers":3299},"Cartan, E., 1946, Lecons sur la geometrie de Riemann",{},{"id":26,"text":3301,"url":26,"identifiers":3302},"Craig, J.J., 1986, Introduction to robotics",{},{"id":26,"text":3304,"url":26,"identifiers":3305},"10.1177\u002F027836498500400304",{"doi":3304},{"id":26,"text":3307,"url":26,"identifiers":3308},"Hanafusa, H., Proc. 7th ISIR",{},{"id":26,"text":3310,"url":26,"identifiers":3311},"10.1177\u002F027836498600400401",{"doi":3310},{"id":26,"text":2706,"url":26,"identifiers":3313},{"doi":2706},{"id":26,"text":3315,"url":26,"identifiers":3316},"Mason, M.T., 1982, Manipulator grasping and pushing operations. Ph.D. Thesis, Department of Electrical Engineering and Computer Science",{},{"id":26,"text":3318,"url":26,"identifiers":3319},"Montana, D.J., 1986, Tactile sensing and the kinematics of contact. Ph.D. Thesis, Division of Applied Sciences",{},{"id":26,"text":3321,"url":26,"identifiers":3322},"10.1109\u002FTSMC.1982.4308818",{"doi":3321},{"id":26,"text":3324,"url":26,"identifiers":3325},"Salisbury, J.K., 1982, Kinematic and force analysis of articulated hands. Ph.D. Thesis",{},{"id":26,"text":3327,"url":26,"identifiers":3328},"Spivak, M., 1979, A comprehensive introduction to differential geometry",{}]