MATH36031 Project 2 - deadline 22nd November 2024, time 1100hrs.
In this project, the dynamics between a fox and a rabbit will be investigated, by solving
differential equations modelling their positions at different times. The initial configuration
is shown in Figure 1, where the fox starts chasing the rabbit while the rabbit tries to escape
from its predator and moves towards its burrow instantaneously. The fox, initially located1
at (300, −550), pursues the rabbit with the initial speed sf0 = 15m/s in one of the following
two possible ways:
Warehouse
R(0,0)
B(600,600)
NW(200,0)
SW(200,−400)
F(300,−550)
Figure 1: Coordinates (in metres) of the fox (F), the rabbit (R) and its burrow (B) and the
two corners (SW,NW) of the warehouse.
❼ if the rabbit is in sight, the fox’s attack path points directly towards the rabbit (the
direction of the velocity vector of the fox is exact from the fox to the rabbit);
❼ if the view of the rabbit is blocked by the corner SW of an impenetrable warehouse
(assuming that the warehouse is extended indefinitely to the east), then the fox runs
1The subscripts f and r denote the fox and rabbit respectively. The units of the coordinates are metres.
1
directly towards this corner. If the rabbit is still not in sight when the corner is reached,
then the fox moves parallel to the NW-SW perimeter of the warehouse until it sees the
rabbit.
The rabbit, initially located at the origin (0, 0), runs towards its burrow at (600, 600) in
a straight line with initial speed sr0 = 11m/s.
Question 1: Constant speeds.. Assuming that both the fox and the rabbit run with
constant speeds sf0 = 15m/s and sr0 = 11m/s respectively, determine whether the rabbit
can be captured before it reaches its burrow. The rabbit is considered to be captured by the
fox, if the distance between them is smaller than or equal to 0.1 meter.
Question 2: Diminishing speeds. Let us consider a more realistic scenario, when
the hungry fox meets the tired rabbit. Because neither the fox nor the rabbit are in their
best conditions, their chasing/escaping speeds diminish in time, according to the amount of
distance (starting from the time they find each other and start running) they have travelled
so far. More precisely, their speeds at time t are given by
sf (t) = sf0e
−µf df (t)
, sr(t) = sr0e
−µrdr(t)
,
where sf0 = 15m/s and sr0 = 11m/s are the same initial speeds as above, µf = 0.0002m−1
and µr = 0.0008m−1 are the rates of the diminishing speeds, df (t) and dr(t) are the distance
they have travelled up to time t(> 0). Determine whether the rabbit can be captured before
it reaches its burrow. (You may assume that this diminishing speed starts from t = 0).
Outputs required You are required to submit a report (maximum 8 pages including
any appendices) in pdf form via the Turnitin submission box on Blackboard. Additionally
you need to submit your m-files or mlx-files used for the MATLAB codes via the Blackboard
Submission Box also on Blackboard. As part of the required output, in your report give
(i) the time T and the location of the fox when either the rabbit is captured or the rabbit
escapes to the burrow; (ii) the distance travelled by the fox in time T . Additionally provide
a plot showing the paths taken by both animals.
Additional information and guidelines
1. All coding must be done in MATLAB.
2. Treat both the fox and the rabbit as points, without worrying about their finite sizes
(as in most models).
3. The questions can be answered with different approaches, but you need to use the
built-in ODE solver ode45 discussed during the lectures.
4. Avoid using hard-coded numbers. Any number in your code should either be given as
initial condition, or be derived from these conditions.
5. Keep to the page length not exceeding eight A4 pages, and there is no need for a title
page or abstract for a relative short report like this. Font sizes should be no smaller
than 11 point, and page margins no smaller than 2cm.
2
6. List the complete code of the whole function at the end of each question, or in an
appendix. Make your source code more readable, by keeping the indentation and
stylistic features, and can be copied from your submitted. Your published results
should be reproducable from the code attached.
7. Have a look at the generic rubric about how your report will be marked, and also the
intended learning outcomes about what you are expected to achieve in the end.
8. Avoid copying (too many) sentences directly from the project description, and try to
restate the problem with your own words or examples if possible.
9. You may use your report in the future as evidences of written work, so take it seriously.
10. Your target audience is a fellow student on your course: explain the questions so that
the report can be understood without this project description and your approach could
be implemented in another computer language like Python. The report should indicate
to the reader how well you understand the problem and the approach you took. Your
goal will be to communicate your solutions to another person rather than to show
you’ve completed the assignment.
11. Balance the explanation of the approach and the comments in the code. Avoid under commenting and over-commenting.
12. Aim for precision and clarity of writing.
13. Since there is no final exam, you are advised to spend at least 15 hours on each project,
with additional self-study if you are less experience with computer programming. Re member for a 10 credit module like this one, you are expect to spend 100 = 10 Ö 10
hours in total (including lectures, labs, self-study and coursework).
14. Please do not put any personal information on the report, only your student ID number.
15. The submission for each project will be open two weeks before the deadline. Only
your last submission will be marked, and anything submitted after the deadline will
be treated late and any penalty will be applied by the Teaching and Learning Office
in June according to the Undergraduate Student Handbook.
16. Whilst this project can be done without the use of any artificial intelligence (AI)
software tools, if you use any AI tools or software to help you with your
project, you must mention this in the report. Please study the guidelines
at
https://manchester-uk.libanswers.com/teaching-and-learning/faq/264824
on how to do this correctly.
The content and accuracy of the report will be your responsibility alone,
and any factually incorrect statements or mathematically incorrect content
will be penalised.
3
17. Your attention is also drawn to to the University’s Academic Malpractice Policy, see
https://documents.manchester.ac.uk/display.aspx?DocID=639. See also the guide lines on the use of AI via the course on Academic Integrity at:
https://www.education.library.manchester.ac.uk/mle/academic-integrity/
18. We are obliged to report cases of suspected academic malpractice, and people may
be subject to an additional oral assessment on the content of the report and codes
submitted.
相关推荐
openworker(Python)
「openworker(Python)」是开源项目(Python)。源码完整,下载解压即可查看使用,适合学习参考、课程设计与二次开发。
MATH36031 Project 2 狐狸追兔微分方程模型详解(Matlab源码)
23.11.24 版纯知识分享,UCM 曼大MATH36031 solving by computer Project 2
Rosenbrock 优化实验:GD、PSO 与 GA 的收敛对比matlab代码.rar
Rosenbrock 优化实验:GD、PSO 与 GA 的收敛对比matlab代码.rar
饿狼追兔的可视化matlab,高阶常微分方程模型饿狼追兔问题数学建模实例
高阶常微分方程模型饿狼追兔问题数学建模实例现有一只兔子、一匹狼,兔子位于狼的正西110米处,假设兔子与狼同时发现对方并一起起跑,兔子往正北70米处的巢穴跑,而狼在追兔子。已知兔子、狼是匀速跑且狼的速度是兔子的两倍。要求:(1)建立狼的运动轨迹微分模型。(2)画出兔子与狼的运动轨迹图形。(3)用解析方法求解,问兔子能否安全回到巢穴?(4)用数值方法求解,问兔子能否安全回到巢穴?【注】常微分方程高阶初...
数字政府政务服务AI大模型赋能智能体平台及AI场景应用规划方案(决策评审版).pptx
数字政府政务服务AI大模型赋能智能体平台及AI场景应用规划方案(决策评审版).pptx
T18_低空经济示范区十五五通感一体化低空智联网与飞行服务保障体系设计方案_生态合作版.pptx
T18_低空经济示范区十五五通感一体化低空智联网与飞行服务保障体系设计方案_生态合作版.pptx
MATH36031 Project 2Python
36031Project2deadline22ndNovember2024,time1100hrs。
T04_城市生命线AI智能体平台及AI大模型应用场景规划方案_技术方案版.pptx
T04_城市生命线AI智能体平台及AI大模型应用场景规划方案_技术方案版.pptx
MATH36031 项目分析
1GC COAEBurrow1−µf df (t)−µrdr(t)burrow;2at3。
EPLAN自动成图与报表实战合集 API批量成图脚本+端子表电缆表自动生成
内容概要:EPLAN自动成图与报表自动生成实战合集,含2篇原创:API批量成图脚本骨架(对象模型+可运行C#代码+三个必踩坑+42页从3.5小时压到11分钟实测)、端子表/电缆表/部件清单报表自动生成(配置逻辑+翻车点+提效数据)。适用人群:电气设计工程师、成套厂制图员、EPLAN二次开发。使用场景:图纸批量生成提效、报表自动化。原创整理。
威百威9000V6商业管理软件-210930稳定版本
支持扫码支付
【FDE知识库】(1):AI 编程时代开发语言选型分析,云使用go,企业用java,算法python,底层c
AI 编程时代,开发语言选型需综合考量AI适配度、编译速度、跨平台与学习成本。Python以海量语料和即时执行成首选,适用于AI/ML与原型开发;TypeScript凭借类型系统与秒级构建,成为前端及应用层主流;Go以极速编译与统一风格,契合AI代理高效迭代需求。Rust/C++虽性能强,但编译慢、学习成本高,不适于快速试错。综合推荐:优先选Python、TypeScript、Go,兼顾效率与生态,实现最优AI协作体验。
旋转中心标定诊断工具(视觉标定失败定位+Kasa圆拟合)
机器视觉旋转中心标定失败诊断工具:Kasa圆拟合求旋转中心+四类失败原因自动定位(标定点共线/旋转角步集中/拟合残差大/像素机器人映射方向反),含README与示例数据,仅依赖numpy,源自真实产线客诉排查经验。
复现基于全局积分滑模控制(GISMC)的欠驱动自主水下航行器(AUV)水平轨迹跟踪控制研究(Simulink仿真、Matlab代码实现)
内容概要:本文研究了基于全局积分滑模控制(GISMC)的欠驱动自主水下航行器(AUV)水平轨迹跟踪控制方法,通过Simulink仿真与Matlab代码实现对该控制策略进行复现与验证。针对欠驱动AUV系统存在的模型不确定性与外部干扰问题,设计了全局积分滑模控制器,有效提升了轨迹跟踪精度与系统鲁棒性,克服了传统滑模控制存在的稳态误差与抖振问题。该控制器通过引入积分项增强了对持续干扰的抑制能力,并确保系统在整个状态空间内实现渐近收敛。仿真结果表明,在复杂海洋环境下,所提方法能够实现对期望轨迹的高精度跟踪,具备优良的动态响应性能与抗干扰能力,适用于AUV在水平面内的精确导航与控制任务。; 适合人群:具备自动控制理论基础、海洋工程背景或从事无人系统控制研究的科研人员,以及熟悉Matlab/Simulink仿真工具的自动化、船舶与海洋工程等相关专业的研究生与工程师。; 使用场景及目标:①用于解决欠驱动AUV在未知扰动下的轨迹跟踪控制问题;②为滑模控制在非线性、强耦合系统中的应用提供仿真验证案例;③推动先进控制算法在水下机器人系统中的工程化实现。; 阅读建议:读者应结合Matlab代码与Simulink模型进行仿真操作,重点关注滑模面设计、控制律推导与参数整定过程,建议在复现基础上尝试引入不同干扰条件或优化控制结构,以深入理解GISMC的控制机理与鲁棒特性。
多目标粒子群算法求解综合能源系统最优容量配置研究(Matlab代码实现)
内容概要:本文研究了基于多目标粒子群算法(MOPSO)求解综合能源系统(IES)中最优容量配置的方法,并提供了完整的Matlab代码实现。研究旨在通过优化风电机组、光伏机组、燃气轮机、储能系统等多种能源设备的容量配置,实现系统在经济性、环保性和能源利用率等方面的多目标平衡。文中构建了综合能源系统容量配置的数学模型,明确了以最低综合成本、最小碳排放为核心的目标函数,以及能量供需平衡、设备出力能力等关键约束条件,并详细阐述了MOPSO算法的实现流程,包括种群初始化、非支配排序、拥挤距离计算和外部存档更新等核心机制。最后,通过Matlab平台的仿真实验验证了该方法的有效性,结果表明该算法能够生成分布均匀且具有良好多样性的Pareto最优解集,为决策者根据不同侧重点选择最终方案提供了科学依据。; 适合人群:具备一定电力系统、优化算法和Matlab编程基础的研究生、科研人员及工程技术人员。; 使用场景及目标:① 学习和掌握综合能源系统容量配置问题的建模方法;② 深入理解多目标粒子群算法(MOPSO)的核心原理及其在实际工程优化问题中的应用;③ 获取可直接运行和修改的Matlab代码,用于复现研究成果或进行二次开发。; 阅读建议:建议读者在阅读时,首先理解综合能源系统的背景和优化问题的数学建模过程,然后结合提供的Matlab代码,逐步跟踪算法的执行流程,重点关注目标函数和约束条件的代码实现,以及MOPSO算法中非支配排序和拥挤距离计算等核心模块。为了更好地掌握,可以尝试调整算例参数、增减优化目标或修改算法参数,观察结果的变化。
PSO-LSTM基于PSO优化LSTM网络的电力负荷预测(Python代码实现)
内容概要:本文提出了一种基于粒子群优化算法(PSO)优化长短期记忆网络(LSTM)的电力负荷预测方法,并通过Python代码实现了完整的模型构建与仿真验证。该方法利用PSO算法全局寻优的能力,自动优化LSTM网络的关键超参数,如学习率、隐含层节点数、训练迭代次数等,从而克服传统LSTM依赖人工调参导致的预测精度不高和收敛速度慢的问题。文中详细阐述了PSO-LSTM混合模型的架构设计、算法流程及其实现细节,结合实际电力负荷数据进行了实验验证,结果表明该模型在预测精度、稳定性与泛化能力方面均优于标准LSTM及其他传统预测模型,尤其适用于短期电力负荷预测任务。; 适合人群:具备一定Python编程基础和机器学习理论知识,从事电力系统分析、能源管理、智能电网调度及相关领域研究的研发人员、工程技术人员及高校研究生。; 使用场景及目标:①应用于电力系统短期负荷预测,提升电网运行调度的科学性与经济性;②为能源管理系统提供高精度负荷数据支持,优化发电计划与资源配置;③作为智能优化算法与深度学习融合的教学案例,帮助学习者掌握PSO与LSTM协同建模的方法与实践技巧;④为后续研究提供可复现的代码基础和技术参考。; 阅读建议:建议读者结合提供的Python代码,动手复现整个建模与训练过程,深入理解PSO优化机制与LSTM网络结构的耦合方式,并尝试在不同时间尺度和负荷场景的数据集上进行迁移测试,以全面评估模型的适应性与鲁棒性。
主动配电网故障恢复的重构与孤岛划分统一模型研究升级版本(Matlab代码实现)
内容概要:本文针对主动配电网在故障情况下的恢复问题,提出了一种网络重构与孤岛划分的统一优化模型,旨在通过协同优化配电网的拓扑结构与分布式电源形成的可控孤岛,最大限度恢复关键负荷供电,提升系统韧性。该模型充分考虑了分布式电源出力特性、负荷分级需求以及配电网辐射状运行等多重约束,构建了以负荷恢复最大化和网络损耗最小化为目标的混合整数非线性规划问题,并采用高效的优化算法进行求解。研究通过Matlab编程实现了完整的模型求解与仿真验证,结果表明所提方法能有效协调重构与孤岛策略,显著提高故障后的供电恢复能力和系统运行的稳定性。; 适合人群:具备电力系统分析、优化理论及Matlab编程基础,从事主动配电网、分布式能源集成、电网韧性提升或智能电网故障恢复等相关领域研究的研究生、科研人员及工程技术人员。; 使用场景及目标:①应用于高比例分布式电源接入的现代配电网故障应急处置与恢复决策;②为提升电网应对极端事件的能力提供先进的理论模型与技术方案;③通过Matlab代码复现与仿真,深入学习和掌握配电网重构、孤岛划分及综合优化的前沿算法。; 阅读建议:建议读者结合电力系统潮流计算、图论基础和优化建模知识进行学习,重点理解模型中目标函数的设计理念、各类物理约束(如潮流、辐射状、孤岛连通性)的数学表征方法,以及求解算法的实现逻辑。务必动手运行并调试所提供的Matlab代码,通过改变网络参数和故障场景来探究模型的适应性和性能边界。
基于粒子群优化算法的三方三层的主从博弈能源系统优化模型研究(Matlab代码实现)
内容概要:本文研究了基于粒子群优化算法的三方三层主从博弈能源系统优化模型,旨在通过Matlab代码实现对包含风、光、火、储等多种能源形式的综合能源系统进行优化调度。该模型构建了包含能源供应商、运营商与用户三类主体的多层次博弈架构,引入主从博弈机制,将不同参与者划分为领导者与跟随者角色,并在不完全信息环境下采用Epsilon纳什均衡策略实现多方利益协调。结合多目标粒子群优化算法,有效解决了系统运行成本、峰谷差与碳排放等多重目标间的权衡问题。研究进一步整合了需求响应与电能转气(P2G)等灵活性资源,提升了系统调节能力,并通过IEEE39等标准系统进行潮流计算与电能质量分析,验证了模型在提升综合能源系统经济性、稳定性与环保性方面的有效性。; 适合人群:具备电力系统、优化算法及博弈论基础知识的科研人员与研究生;从事能源系统优化、智能调度及相关领域研究的专业技术人员;有志于复现高水平期刊论文成果并开展创新性研究的硕博生。; 使用场景及目标:① 学习并掌握主从博弈在综合能源系统中的建模方法与求解流程;② 理解多目标粒子群算法在复杂能源调度问题中的应用技巧;③ 掌握需求响应、P2G等灵活性资源在系统优化中的集成方式;④ 借助Matlab代码复现IEEE39系统的潮流计算与电能质量分析过程,支撑科研项目或学术论文撰写。; 阅读建议:本资源以Matlab代码为核心载体,强调理论建模与仿真实践的深度融合。建议读者在学习过程中结合博弈论与智能优化算法的基础理论,逐步调试代码并分析关键参数的影响,重点关注Epsilon纳什均衡的实现逻辑与多目标优化的收敛特性,从而深入理解能源系统协同优化的内在机制。
1392



被折叠的 条评论
为什么被折叠?



