首页
网站开发
桌面应用
管理软件
微信开发
App开发
嵌入式软件
工具软件
数据采集与分析
其他
首页
>
> 详细
COMP4620代做、代写Java/Python程序语言
项目预算:
开发周期:
发布时间:
要求地区:
COMP4620/8620: Advanced Topics in ML – Intelligent Robotics
Semester-22024–Assignment1
Duedate: Monday,26August202410.00amCanberratime
Graceperiod: 5hoursaftertheduedate
Latesubmission: Notpermitted
Pleasereadthefollowingnotesfirstbeforestartingtoworkontheassignment.
1. Thisisanindividualassignment.
2. Themaximumtotalmarkforthisassignmentis100points
3. This assignment consists of two parts: Part A and Part B. Part A contains conceptual questions
only. The maximum total mark for Part A is 30 points. Part B contains conceptual questions,
programmingandanalysis. ThemaximumtotalmarkforPartBis70points.
4. SubmissionInstruction:
(a) Youcanwriteyourprograminaprogramminglanguageofyourchoice.
(b) You must submit all of your source codes. If your program consists of multiple files,
you must place all files under a single folder, compress the folder into a single file with
one of the following extensions: .zip or .7z or .tar.gz, and submit this compressed file. If
your program consists of multiple files in multiple folders, your compressed file should
preservethefolderstructure.
(c) In your selection of programming language and in compressing the files, you must con-
sider that during the demo, you will need to download your submission, extract your
source codes, compile (if needed), and run the program in front of the tutor marking your
assignmentwithoutmakinganychangestothesourcecode.
(d) Allnon-programmingpartsoftheassignmentmustbewritteninasingle.pdffile.
(e) Thetwofiles(sourcecodesand.pdf)mustbesubmittedviawattlebeforetheduedate.
(f) Late submission is NOT permitted. However, we provide a 5 hours grace period. Within
the grace period, you can still submit your assignment. However, after the grace period
ends,youwillNOTbeabletosubmityourassignment.
5. Informationaboutthein-persondemowillbeannouncedintheclassforum.
PARTA
The questions in this part aim to explore the relation between
distanceintheC-spaceandintheworkspace.
To achieve the above objective, consider a planar kinematic
chain robot as illustrated in Figure 1. It has a static base, K ro-
tational joints and K links. Each joint is represented as a point.
Each link is a straight line segment with length L. It has two
end-points, called the origin and the extremity points. The po-
sition of the origin of the first link is fixed. The origin of the ith
linkfori ∈ [2,K]coincideswiththeextremityofthe(i?1)thlink Figure1: Anillustrationoftheplanar
atajointpoint. Therobotoperatesina2Dworkspacepopulated kinematicchainrobot.
byasetofobstaclesObs.
Page1of3–AdvancedTopicsinML:IntelligentRobotics–COMP4680/8650
Aconfigurationoftheaboverobotcanberepresentedbyq = (θ ,θ ,··· ,θ ),whereθ ∈ [0,2π)isthe
1 2 K i
jointanglethatdefinestheangle(inradian)betweenthebaseandthefirstlinkfori = 1,andbetween
theith and(i?1)th linkfori = [2,K]. TheC-spaceofthisrobotcanberepresentedasthespaceRK.
In addition, let us define the C-space distance between two configurations, q = (θ ,θ ,··· ,θ ) and
1 2 K
q(cid:48) = (θ(cid:48),θ(cid:48),··· ,θ(cid:48) ), as: d (q,q(cid:48)) = max |θ ? θ(cid:48)|. This distance metric is often used in motion
1 2 K C 1≤i≤K i i
planningbecauseitisfastertocompute,comparedtothetypicalEuclideandistance.
Pleaseanswerthefollowingquestions.
1. [20 pts] Given 2 configurations, q = (θ ,θ ,··· ,θ ) and q(cid:48) = (θ(cid:48),θ(cid:48),··· ,θ(cid:48) ), let us assume
1 2 K 1 2 K
the robot moves from q to q(cid:48) along a straight line segment qq(cid:48) in the C-space. It is known that
during such a movement, all points on the robot traces a path of length less than or equal to
α·d (q,q(cid:48)), where α is a constant that can be upper bounded in terms of the link length L and
C
thenumberoflinksK. PleasefindthisupperboundofαandexpressedtheminLandK. Please
provideitsderivation. Hintsareavailableinthelastpage.
2. [10 pts] Now, recall that the workspace distance d (q,Obs) between the configuration q and
W
obstacles Obs in the workspace is defined as the distance between the closest pair of points
on the robot placed at configuration q and Obs. Please find the radius τ of the neighbourhood
Neigh(q) = {q(cid:48) | d (q,q(cid:48)) ≤ τ} that will guarantee the robot can move from configuration q to
C
q(cid:48) (for any q(cid:48) ∈ Neigh(q)) collision-free, following a straight line path qq(cid:48). Please express τ in
termsoftheupperboundαfromA.1. andd (q,Obs).
W
PARTB
The questionsin this part aimto provide hands-onexperience and better understandingof Sampling-
based Motion Planning. To this end, let’s consider K rigid-body sphere robots are navigating a 3D
workspace[?50,50]×[?50,50]×[?50,50] ? R3 populatedbyobstaclesintheshapeofcubes. And
supposeeachrobotcanonlytranslate. Pleaseanswerthequestionsbelow.
1. [5 pts] Please specify the C-space of the K robots. Assume that the origin of the coordinate
systemofeachrobotisatthecenterofthesphere.
2. [35 pts] Please write a sampling-based motion planning program for centralised planning of
the robots. A collision-free path here means the robot will not collide with the obstacles and
otherrobots. PleaseimplementeitherPRMwithanyoneormoresamplingstrategiesdiscussed
in class, EST, or RRT. You can use and extend the collision check methods discussed in the
pasttwoweekstutorials. Notethatanedgeinagraph/treeinSampling-basedMotionPlanning
represents a straight line-segment in the C-space, which in this case represents K (sub-)paths
for K robots. Weassumeallrobotsmoveinsuchawaythattheyspendtheexactsameduration
and use constant velocity to traverse their respective (sub-)paths, though the velocity used by
differentrobotsmaydiffer.
Theinputtoyourprogrammustbeatext(.txt)fileandfollowstheformatbelow.
(a) The file consists of K +|Obs|+2 lines, where K is the number of robots and |Obs| is the
numberofobstaclesintheenvironment.
(b) Thefirstlinecontainstwonumbersseparatedbyasinglewhitespace. Thefirstnumberin
thislineisthenumberofrobots,whilstthesecondnumberisthenumberofobstacles.
(c) The second line consists of K numbers, each separated by a white space. The ith number
inthislineistheradiusofrobot-i.
Page2of3–AdvancedTopicsinML:IntelligentRobotics–COMP4680/8650
(d) Each of line-3 to line K +2 contains 6 numbers, which specifies the initial and goal con-
figurationsoftheith robot,wherei = lineNumber?2. Theformatofeachlineis:
InitialConf X InitialConf Y InitialConf Z ; GoalConf X GoalConf Y GoalConf Z
(e) Each of line K +3 to line K +|Obs|+2 contains 4 numbers separated by a white space,
which specifies the position of the center point and side length of the jth obstacle where
j = lineNumber?(K +2)Theformatofeachoftheselinesis:
CenterPt X CenterPt Y CenterPt Z SideLength
The output to your program must be a text (.txt) file that specifies the collision-free path (a
sequence of line segments) for the robots to move from the given initial to goal configurations.
Theformatoftheoutputfileisasfollows.
(a) Thefileconsistsofn+2lines,wherenisthenumberoflinesegmentsinyourpath
(b) Thefirstlineisthenumberofline-segments
(c) The second line consists of 3K numbers, specifying the initial configuration of each of
the K robots. Each configuration is separated by a semicolon, while each number in a
configurationisseparatedbyawhitespace. Specifically,theformatofline-2is:
ConfRobot-1 X ConfRobot-1 Y ConfRobot-1 Z ; ConfRobot-2 X ConfRobot-2 Y
ConfRobot-2 Z ; ··· ; ConfRobot-K X ConfRobot-K Y ConfRobot-K Z
(d) Thenextnlinesaretheendconfigurationofeachlinesegment. Eachoftheselinesconsists
of3K numbersandusestheformatasspecifiedforline-2oftheoutputfile(aboveitem)
During demonstration, we will test the correctness of your program. For this purpose, we will
providethreeproblemsandgiveyourprogramupto1minutetosolveeachproblem.
3. [12 pts] Please evaluate the required time that your program needs to solve queries (i.e., find
collision free paths) as the number of robots increases. For this purpose, please run your pro-
gram for K = {1,3,5,7} on the same environment of your design. For each value of K, you
should run for at least 10× to gather the average and 95%-confidence interval of the time to
solvequeries. Ifthetimetofindthesolutionistoolong,youcanputalimitontherun-timeand
recordthesuccessrateofsolvingquerieswithinthegiventime,inadditiontothetimetosolve
queries. Please explain your selection of the environment, compare the results for the different
K andexplainyourfindings.
4. [12 pts] Please evaluate the performance of your program as the problem becomes more com-
plex. To this end, please use K = 3 but alter the testing environment systematically, so as to
tease out the complexity of sampling-based motion planning (hint: the concept of (cid:15),α,β could
be useful in this design). For each environment, you should run for at least 10× to gather the
averageand95%-confidenceintervalofthetimetosolvequeries. Ifthetimetofindthesolution
is too long, you can put a limit on the run-time and record the success rate of solving queries
within the given time, in addition to the time to solve queries. Please explain your selection of
theenvironments,comparetheresultsforthedifferentenvironment,andexplainyourfindings.
5. [6pts]WhatdoyouthinkcanbedonetoimprovetheperformanceyougetinB.3andB.4?
oOo That’s all folks oOo
)1+2
K(K =
i1= Ki
(cid:80) ?
r·θsinaidar θelgnalartnecdna rsuidarhtiwelcricafocranA ?
.1.ArewsnaotsalumrofgniwollofehtdeenylekillliwuoY :tniH
Page3of3–AdvancedTopicsinML:IntelligentRobotics–COMP4680/8650
软件开发、广告设计客服
QQ:99515681
邮箱:99515681@qq.com
工作时间:8:00-23:00
微信:codinghelp
热点项目
更多
代做 program、代写 c++设计程...
2024-12-23
comp2012j 代写、代做 java 设...
2024-12-23
代做 data 编程、代写 python/...
2024-12-23
代做en.553.413-613 applied s...
2024-12-23
代做steady-state analvsis代做...
2024-12-23
代写photo essay of a deciduo...
2024-12-23
代写gpa analyzer调试c/c++语言
2024-12-23
代做comp 330 (fall 2024): as...
2024-12-23
代写pstat 160a fall 2024 - a...
2024-12-23
代做pstat 160a: stochastic p...
2024-12-23
代做7ssgn110 environmental d...
2024-12-23
代做compsci 4039 programming...
2024-12-23
代做lab exercise 8: dictiona...
2024-12-23
热点标签
mktg2509
csci 2600
38170
lng302
csse3010
phas3226
77938
arch1162
engn4536/engn6536
acx5903
comp151101
phl245
cse12
comp9312
stat3016/6016
phas0038
comp2140
6qqmb312
xjco3011
rest0005
ematm0051
5qqmn219
lubs5062m
eee8155
cege0100
eap033
artd1109
mat246
etc3430
ecmm462
mis102
inft6800
ddes9903
comp6521
comp9517
comp3331/9331
comp4337
comp6008
comp9414
bu.231.790.81
man00150m
csb352h
math1041
eengm4100
isys1002
08
6057cem
mktg3504
mthm036
mtrx1701
mth3241
eeee3086
cmp-7038b
cmp-7000a
ints4010
econ2151
infs5710
fins5516
fin3309
fins5510
gsoe9340
math2007
math2036
soee5010
mark3088
infs3605
elec9714
comp2271
ma214
comp2211
infs3604
600426
sit254
acct3091
bbt405
msin0116
com107/com113
mark5826
sit120
comp9021
eco2101
eeen40700
cs253
ece3114
ecmm447
chns3000
math377
itd102
comp9444
comp(2041|9044)
econ0060
econ7230
mgt001371
ecs-323
cs6250
mgdi60012
mdia2012
comm221001
comm5000
ma1008
engl642
econ241
com333
math367
mis201
nbs-7041x
meek16104
econ2003
comm1190
mbas902
comp-1027
dpst1091
comp7315
eppd1033
m06
ee3025
msci231
bb113/bbs1063
fc709
comp3425
comp9417
econ42915
cb9101
math1102e
chme0017
fc307
mkt60104
5522usst
litr1-uc6201.200
ee1102
cosc2803
math39512
omp9727
int2067/int5051
bsb151
mgt253
fc021
babs2202
mis2002s
phya21
18-213
cege0012
mdia1002
math38032
mech5125
07
cisc102
mgx3110
cs240
11175
fin3020s
eco3420
ictten622
comp9727
cpt111
de114102d
mgm320h5s
bafi1019
math21112
efim20036
mn-3503
fins5568
110.807
bcpm000028
info6030
bma0092
bcpm0054
math20212
ce335
cs365
cenv6141
ftec5580
math2010
ec3450
comm1170
ecmt1010
csci-ua.0480-003
econ12-200
ib3960
ectb60h3f
cs247—assignment
tk3163
ics3u
ib3j80
comp20008
comp9334
eppd1063
acct2343
cct109
isys1055/3412
math350-real
math2014
eec180
stat141b
econ2101
msinm014/msing014/msing014b
fit2004
comp643
bu1002
cm2030
联系我们
- QQ: 9951568
© 2021
www.rj363.com
软件定制开发网!